PUB - Publikationen an der Universität Bielefeld

Alle markieren

• [27]
  

  2024 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2985702

  Dias Vieira Braga, M., et al., 2024. Investigating the complexity of the double distance problems. Algorithms for Molecular Biology, 19: 1.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [26]
  

  2023 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2983338

  Rubert, D., & Dias Vieira Braga, M., 2023. Efficient gene orthology inference via large-scale rearrangements. Algorithms for Molecular Biology , 18(1): 14.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [25]
  

  2023 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2981606

  Dias Vieira Braga, M., et al., 2023. On the Class of Double Distance Problems. In K. Jahn & T. Vinař, eds. Comparative Genomics. 20th International Conference, RECOMB-CG 2023, Istanbul, Turkey, April 14–15, 2023, Proceedings. Lecture Notes in Computer Science. no.13883 Cham: Springer Nature , pp. 35-50.

  PUB | DOI
   
• [24]
  

  2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2968237

  Rubert, D., & Dias Vieira Braga, M., 2022. Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes. In C. Boucher & S. Rahmann, eds. 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Leibniz International Proceedings in Informatics (LIPIcs). no.242 Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik.

  PUB | PDF | DOI | Download (ext.)
   
• [23]
  

  2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965398

  Dias Vieira Braga, M., et al., 2022. A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. In C. Boucher & S. Rahmann, eds. 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Leibniz International Proceedings in Informatics. LIPIcs. no.242 Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 13:1-13:16.

  PUB | DOI
   
• [22]
  

  2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2954832

  Rubert, D., Martinez, F.V., & Dias Vieira Braga, M., 2021. Natural family-free genomic distance. Algorithms for molecular biology : AMB, 16(1): 4.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [21]
  

  2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2959611

  Rubert, 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.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [20]
  

  2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2942686

  Willing, E., Stoye, J., & Dias Vieira Braga, M., 2021. Computing the Inversion-Indel Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 18(6), p 2314-2326.

  PUB | DOI | WoS | PubMed | Europe PMC | arXiv
   
• [19]
  

  2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2946303

  Bohnenkämper, L., et al., 2021. Computing the rearrangement distance of natural genomes. Journal of Computational Biology, 28(4), p 410-431.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [18]
  

  2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965072

  Rubert, D., Martinez, F.V., & Dias Vieira Braga, M., 2020. Natural Family-Free Genomic Distance. In C. Kingsford & N. Pisanti, eds. 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Leibniz International Proceedings in Informatics (LIPIcs). no.172 Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 3:1-3:23.

  PUB | PDF | DOI | Download (ext.)
   
• [17]
  

  2020 | Preprint | Veröffentlicht | PUB-ID: 2939861

  Bohnenkämper, L., et al., 2020. Computing the rearrangement distance of natural genomes. arXiv:2001.02139.

  PUB | Download (ext.) | arXiv
   
• [16]
  

  2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2939729

  Bohnenkämper, L., et al., 2020. Computing the rearrangement distance of natural genomes. In Proceedings of RECOMB 2020. LNBI. no.12074 pp. 3-18.

  PUB | DOI
   
• [15]
  

  2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006

  Rubert, D., et al., 2018. Computing the family-free DCJ similarity. BMC Bioinformatics, 19(Suppl. 6): 152.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [14]
  

  2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015

  Rubert, D., et al., 2017. Algorithms for Computing the Family-Free Genomic Similarity under DCJ. In J. Meidanis & L. Nakhleh, eds. Comparative Genomics. RECOMB-CG 2017. Lecture Notes in Bioinformatics. no.10562 Cham: Springer Verlag, pp. 76-100.

  PUB | DOI
   
• [13]
  

  2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057

  Rubert, D., et al., 2017. Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology, 12(1): 3.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [12]
  

  2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2916552

  da Silva, P.H., et al., 2017. Genomic Distance with High Indel Costs. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 14(3), p 728-732.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [11]
  

  2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708

  Rubert, D., et al., 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. Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Bioinformatics. no.9838 Cham: Springer, pp. 293-306.

  PUB | DOI
   
• [10]
  

  2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2726366

  Viduani Martinez, F.H., et al., 2015. On the family-free DCJ distance and similarity. Algorithms for Molecular Biology, 10(1): 13.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [9]
  

  2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2677844

  Dias Vieira Braga, M., & Stoye, J., 2015. Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12(3), p 500-506.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [8]
  

  2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611648

  Dias Vieira Braga, M., et al., 2013. The Potential of Family-Free Genome Comparison. In C. Chauve, N. El-Mabrouk, & E. Tannier, eds. Models and Algorithms for Genome Evolution. Computational Biology Series. no.19 London: Springer Verlag, pp. 287-307.

  PUB | DOI
   
• [7]
  

  2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091794

  Dias Vieira Braga, M., Willing, E., & Stoye, J., 2011. Double Cut and Join with Insertions and Deletions. Journal of Computational Biology, 18(9), p 1167-1184.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [6]
  

  2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091790

  Kovac, J., et al., 2011. Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation. Journal of Computational Biology, 18(9), p 1231-1241.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [5]
  

  2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919216

  Kovac, J., Dias Vieira Braga, M., & Stoye, J., 2010. The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. In Proc. of Recomb-CG 2010. LNBI. no.6398 pp. 13-24.

  PUB | DOI
   
• [4]
  

  2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898025

  Dias Vieira Braga, M., & Stoye, J., 2010. The Solution Space of Sorting by DCJ. Journal of Computational Biology, 17(9), p 1145-1165.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [3]
  

  2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919215

  Dias Vieira Braga, M., Willing, E., & Stoye, J., 2010. Genomic Distance with DCJ and Indels. In Proc. of WABI 2010. LNBI. no.6293 pp. 90-101.

  PUB | DOI
   
• [2]
  

  2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919206

  Dias Vieira Braga, M., & Stoye, J., 2009. Counting All DCJ Sorting Scenarios. In Proc. of Recomb-CG 2009. LNBI. no.5817 pp. 36-47.

  PUB | DOI
   
• [1]
  

  2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1588760

  Dias Vieira Braga, M., Gautier, C., & Sagot, M.-F., 2009. An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology, 4(1), p 16.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC