18 Publikationen
-
2023 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2983338Rubert, D., & Dias Vieira Braga, M. (2023). Efficient gene orthology inference via large-scale rearrangements. Algorithms for Molecular Biology , 18(1), 14. https://doi.org/10.1186/s13015-023-00238-y
-
2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2968237Rubert, D., & Dias Vieira Braga, M. (2022). Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes. In C. Boucher & S. Rahmann (Eds.), Leibniz International Proceedings in Informatics (LIPIcs): Vol. 242. 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022) Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.WABI.2022.24
-
2022 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 2965058Silva, H. O. M., Rubert, D., Araujo, E., & Martinez, F. V. (2022). Algorithms for a Restricted Genome Median Problem. In M. Bezerra Campêlo Neto, C. Gomes Fernandes, & V. Fernandes dos Santos (Eds.), Anais do VII Encontro de Teoria da Computação (ETC 2022) = Proceedings of the 7th Theory of Computation Meeting (pp. 45-48). Porto Alegre, RS: Sociedade Brasileira de Computação - SBC. https://doi.org/10.5753/etc.2022.222734
-
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2954832Rubert, D., Martinez, F. V., & Dias Vieira Braga, M. (2021). Natural family-free genomic distance. Algorithms for molecular biology : AMB, 16(1), 4. https://doi.org/10.1186/s13015-021-00183-8
-
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2959611Rubert, D., Doerr, D., & Dias Vieira Braga, M. (2021). The potential of family-free rearrangements towards gene orthology inference. Journal of Bioinformatics and Computational Biology, 19(6), 2140014. https://doi.org/10.1142/S021972002140014X
-
2021 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965069Araujo, E., Rozante, L. C., Rubert, D., & Martinez, F. V. (2021). Algorithms for Normalized Multiple Sequence Alignments. In H. - K. Ahn & K. Sadakane (Eds.), Leibniz International Proceedings in Informatics (LIPIcs): Vol. 212. 32nd International Symposium on Algorithms and Computation (ISAAC 2021) (pp. 40:1-40:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2021.40
-
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2965062Stefanes, M. A., Rubert, D., & Soares, J. (2020). Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science, 804, 58-71. https://doi.org/10.1016/j.tcs.2019.10.042
-
2020 | Preprint | Veröffentlicht | PUB-ID: 2943670Rubert, D., Araujo, E., Stefanes, M. A., Stoye, J., & Martinez, F. V. (2020). On motifs in colored graphs. arXiv:2005.13634
-
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2942995Rubert, D., Araujo, E., Stefanes, M. A., Stoye, J., & Martinez, F. (2020). Searching and Inferring Colorful Topological Motifs in Vertex-Colored Graphs. Journal of Combinatorial Optimization, 40, 379–411. https://doi.org/10.1007/s10878-020-00590-4
-
2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965072Rubert, D., Martinez, F. V., & Dias Vieira Braga, M. (2020). Natural Family-Free Genomic Distance. In C. Kingsford & N. Pisanti (Eds.), Leibniz International Proceedings in Informatics (LIPIcs): Vol. 172. 20th International Workshop on Algorithms in Bioinformatics (WABI 2020) (pp. 3:1-3:23). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.WABI.2020.3
-
2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965061Rubert, D., Stoye, J., & Martinez, F. H. V. (2020). Distance and Similarity Measures in Comparative Genomics. In D. Avila Vecchiato (Ed.), Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC 2020) = Proceedings of the 33rd Thesis and Dissertation Contest (pp. 7-12). Porto Alegre, RS: Sociedade Brasileira de Computação - SBC. https://doi.org/10.5753/ctd.2020.11361
-
2020 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2937712Rubert, D., Martinez, F. H. V., Stoye, J., & Dörr, D. (2020). Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants. BMC Genomics, 21(Suppl. 2), 273. https://doi.org/10.1186/s12864-020-6609-x
-
2019 | Datenpublikation | PUB-ID: 2936848Dörr, D., & Rubert, D. (2019). Supplementary Data for "Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants". Bielefeld University. https://doi.org/10.4119/unibi/2936848
-
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006Rubert, D., Hoshino, E. A., Dias Vieira Braga, M., Stoye, J., & Martinez, F. H. V. (2018). Computing the family-free DCJ similarity. BMC Bioinformatics, 19(Suppl. 6), 152. https://doi.org/10.1186/s12859-018-2130-5
-
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015Rubert, D., Medeiros, G. L., Hoshino, E. A., Dias Vieira Braga, M., Stoye, J., & Martinez, F. H. V. (2017). Algorithms for Computing the Family-Free Genomic Similarity under DCJ. In J. Meidanis & L. Nakhleh (Eds.), Lecture Notes in Bioinformatics: Vol. 10562. Comparative Genomics. RECOMB-CG 2017 (pp. 76-100). Cham: Springer Verlag. https://doi.org/10.1007/978-3-319-67979-2_5
-
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., & Martinez, F. H. V. (2017). Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology, 12(1), 3. https://doi.org/10.1186/s13015-017-0095-y
-
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., & Martinez, F. H. V. (2016). A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. In M. Frith & C. N. Storm Pedersen (Eds.), Lecture Notes in Bioinformatics: Vol. 9838. Algorithms in Bioinformatics. WABI 2016 (pp. 293-306). Cham: Springer. https://doi.org/10.1007/978-3-319-43681-4_24
-
2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965063Rubert, D., Araujo, E., & Stefanes, M. A. (2015). SIMBio: Searching and inferring colorful motifs in biological networks. 2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE), 1-6. IEEE. https://doi.org/10.1109/BIBE.2015.7367733