27 Publikationen
-
2024 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2985702Dias Vieira Braga, M., Brockmann, L. R., Klerx, K., and Stoye, J. (2024). Investigating the complexity of the double distance problems. Algorithms for Molecular Biology 19:1.PUB | DOI | WoS | PubMed | Europe PMC
-
-
2023 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2981606Dias Vieira Braga, M., Brockmann, L. R., Klerx, K., and Stoye, J. (2023). “On the Class of Double Distance Problems” in Comparative Genomics. 20th International Conference, RECOMB-CG 2023, Istanbul, Turkey, April 14–15, 2023, Proceedings, Jahn, K., and Vinař, T. eds. Lecture Notes in Computer Science, vol. 13883, (Cham: Springer Nature ), 35-50.PUB | DOI
-
2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2968237
Rubert, D., and Dias Vieira Braga, M. (2022). “Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes” in 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), Boucher, C., and Rahmann, S. eds. Leibniz International Proceedings in Informatics (LIPIcs), vol. 242, (Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik).PUB | PDF | DOI | Download (ext.) -
2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965398Dias Vieira Braga, M., Brockmann, L. R., Klerx, K., and Stoye, J. (2022). “A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance” in 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), Boucher, C., and Rahmann, S. eds. Leibniz International Proceedings in Informatics. LIPIcs, vol. 242, (Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik), 13:1-13:16.PUB | DOI
-
-
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2959611Rubert, D., Doerr, D., and Dias Vieira Braga, M. (2021). The potential of family-free rearrangements towards gene orthology inference. Journal of Bioinformatics and Computational Biology 19:2140014.PUB | DOI | WoS | PubMed | Europe PMC
-
-
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2946303Bohnenkämper, L., Dias Vieira Braga, M., Dörr, D., and Stoye, J. (2021). Computing the rearrangement distance of natural genomes. Journal of Computational Biology 28, 410-431.PUB | DOI | WoS | PubMed | Europe PMC
-
2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965072
Rubert, D., Martinez, F. V., and Dias Vieira Braga, M. (2020). “Natural Family-Free Genomic Distance” in 20th International Workshop on Algorithms in Bioinformatics (WABI 2020), Kingsford, C., and Pisanti, N. eds. Leibniz International Proceedings in Informatics (LIPIcs), vol. 172, (Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik), 3:1-3:23.PUB | PDF | DOI | Download (ext.)
-
2020 | Preprint | Veröffentlicht | PUB-ID: 2939861Bohnenkämper, L., Dias Vieira Braga, M., Dörr, D., and Stoye, J. (2020). Computing the rearrangement distance of natural genomes. arXiv:2001.02139.PUB | Download (ext.) | arXiv
-
-
-
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015Rubert, D., Medeiros, G. L., Hoshino, E. A., Dias Vieira Braga, M., Stoye, J., and Martinez, F. H. V. (2017). “Algorithms for Computing the Family-Free Genomic Similarity under DCJ” in Comparative Genomics. RECOMB-CG 2017, Meidanis, J., and Nakhleh, L. eds. Lecture Notes in Bioinformatics, vol. 10562, (Cham: Springer Verlag), 76-100.PUB | DOI
-
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057
Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., and Martinez, F. H. V. (2017). Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology 12:3.PUB | PDF | DOI | WoS | PubMed | Europe PMC
-
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2916552da Silva, P. H., Machado, R., Dantas, S., and Dias Vieira Braga, M. (2017). Genomic Distance with High Indel Costs. IEEE/ACM Transactions on Computational Biology and Bioinformatics 14, 728-732.PUB | DOI | WoS | PubMed | Europe PMC
-
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708Rubert, D., Feijão, P., Dias Vieira Braga, M., Stoye, J., and Martinez, F. H. V. (2016). “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates” in Algorithms in Bioinformatics. WABI 2016, Frith, M., and Storm Pedersen, C. N. eds. Lecture Notes in Bioinformatics, vol. 9838, (Cham: Springer), 293-306.PUB | DOI
-
-
2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2677844Dias Vieira Braga, M., and Stoye, J. (2015). Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12, 500-506.PUB | DOI | WoS | PubMed | Europe PMC
-
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611648Dias Vieira Braga, M., Chauve, C., Dörr, D., Jahn, K., Stoye, J., Thévenin, A., and Wittler, R. (2013). “The Potential of Family-Free Genome Comparison” in Models and Algorithms for Genome Evolution, Chauve, C., El-Mabrouk, N., and Tannier, E. eds. Computational Biology Series, vol. 19, (London: Springer Verlag), 287-307.PUB | DOI
-
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091794Dias Vieira Braga, M., Willing, E., and Stoye, J. (2011). Double Cut and Join with Insertions and Deletions. Journal of Computational Biology 18, 1167-1184.PUB | DOI | WoS | PubMed | Europe PMC
-
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091790Kovac, J., Warren, R., Dias Vieira Braga, M., and Stoye, J. (2011). Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation. Journal of Computational Biology 18, 1231-1241.PUB | DOI | WoS | PubMed | Europe PMC
-
-
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898025Dias Vieira Braga, M., and Stoye, J. (2010). The Solution Space of Sorting by DCJ. Journal of Computational Biology 17, 1145-1165.PUB | DOI | WoS | PubMed | Europe PMC
-
-
-