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