Marília Dias Vieira Braga

mbraga@cebitec.uni-bielefeld.de
PEVZ-ID
61889960

27 Publikationen

Alle markieren

  • [27]
    2024 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2985702
    M. Dias Vieira Braga, et al., “Investigating the complexity of the double distance problems”, Algorithms for Molecular Biology, vol. 19, 2024, : 1.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [26]
    2023 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2983338 OA
    D. Rubert and M. Dias Vieira Braga, “Efficient gene orthology inference via large-scale rearrangements”, Algorithms for Molecular Biology , vol. 18, 2023, : 14.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
  • [25]
    2023 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2981606
    M. Dias Vieira Braga, et al., “On the Class of Double Distance Problems”, Comparative Genomics. 20th International Conference, RECOMB-CG 2023, Istanbul, Turkey, April 14–15, 2023, Proceedings, K. Jahn and T. Vinař, eds., Lecture Notes in Computer Science, vol. 13883, Cham: Springer Nature , 2023, pp.35-50.
    PUB | DOI
     
  • [24]
    2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2968237 OA
    D. Rubert and M. Dias Vieira Braga, “Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes”, 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), C. Boucher and S. Rahmann, eds., Leibniz International Proceedings in Informatics (LIPIcs), vol. 242, Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2022.
    PUB | PDF | DOI | Download (ext.)
     
  • [23]
    2022 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965398
    M. Dias Vieira Braga, et al., “A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance”, 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), C. Boucher and S. Rahmann, eds., Leibniz International Proceedings in Informatics. LIPIcs, vol. 242, Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, pp.13:1-13:16.
    PUB | DOI
     
  • [22]
    2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2954832 OA
    D. Rubert, F.V. Martinez, and M. Dias Vieira Braga, “Natural family-free genomic distance.”, Algorithms for molecular biology : AMB, vol. 16, 2021, : 4.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
  • [21]
    2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2959611
    D. Rubert, D. Doerr, and M. Dias Vieira Braga, “The potential of family-free rearrangements towards gene orthology inference”, Journal of Bioinformatics and Computational Biology, vol. 19, 2021, : 2140014.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [20]
    2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2942686
    E. Willing, J. Stoye, and M. Dias Vieira Braga, “Computing the Inversion-Indel Distance”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 18, 2021, pp. 2314-2326.
    PUB | DOI | WoS | PubMed | Europe PMC | arXiv
     
  • [19]
    2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2946303
    L. Bohnenkämper, et al., “Computing the rearrangement distance of natural genomes”, Journal of Computational Biology, vol. 28, 2021, pp. 410-431.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [18]
    2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2965072 OA
    D. Rubert, F.V. Martinez, and M. Dias Vieira Braga, “Natural Family-Free Genomic Distance”, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020), C. Kingsford and N. Pisanti, eds., Leibniz International Proceedings in Informatics (LIPIcs), vol. 172, Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, pp.3:1-3:23.
    PUB | PDF | DOI | Download (ext.)
     
  • [17]
    2020 | Preprint | Veröffentlicht | PUB-ID: 2939861
    L. Bohnenkämper, et al., “Computing the rearrangement distance of natural genomes”, arXiv:2001.02139, 2020.
    PUB | Download (ext.) | arXiv
     
  • [16]
    2020 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2939729
    L. Bohnenkämper, et al., “Computing the rearrangement distance of natural genomes”, Proceedings of RECOMB 2020, LNBI, vol. 12074, 2020, pp.3-18.
    PUB | DOI
     
  • [15]
    2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006 OA
    D. Rubert, et al., “Computing the family-free DCJ similarity”, BMC Bioinformatics, vol. 19, 2018, : 152.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
  • [14]
    2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015
    D. Rubert, et al., “Algorithms for Computing the Family-Free Genomic Similarity under DCJ”, Comparative Genomics. RECOMB-CG 2017, J. Meidanis and L. Nakhleh, eds., Lecture Notes in Bioinformatics, vol. 10562, Cham: Springer Verlag, 2017, pp.76-100.
    PUB | DOI
     
  • [13]
    2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057 OA
    D. Rubert, et al., “Approximating the DCJ distance of balanced genomes in linear time”, Algorithms for Molecular Biology, vol. 12, 2017, : 3.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
  • [12]
    2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2916552
    P.H. da Silva, et al., “Genomic Distance with High Indel Costs”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 14, 2017, pp. 728-732.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [11]
    2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708
    D. Rubert, et al., “A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates”, Algorithms in Bioinformatics. WABI 2016, M. Frith and C.N. Storm Pedersen, eds., Lecture Notes in Bioinformatics, vol. 9838, Cham: Springer, 2016, pp.293-306.
    PUB | DOI
     
  • [10]
    2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2726366 OA
    F.H. Viduani Martinez, et al., “On the family-free DCJ distance and similarity”, Algorithms for Molecular Biology, vol. 10, 2015, : 13.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
  • [9]
    2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2677844
    M. Dias Vieira Braga and J. Stoye, “Sorting linear genomes with rearrangements and indels”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 12, 2015, pp. 500-506.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [8]
    2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611648
    M. Dias Vieira Braga, et al., “The Potential of Family-Free Genome Comparison”, Models and Algorithms for Genome Evolution, C. Chauve, N. El-Mabrouk, and E. Tannier, eds., Computational Biology Series, vol. 19, London: Springer Verlag, 2013, pp.287-307.
    PUB | DOI
     
  • [7]
    2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091794
    M. Dias Vieira Braga, E. Willing, and J. Stoye, “Double Cut and Join with Insertions and Deletions”, Journal of Computational Biology, vol. 18, 2011, pp. 1167-1184.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [6]
    2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091790
    J. Kovac, et al., “Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation”, Journal of Computational Biology, vol. 18, 2011, pp. 1231-1241.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [5]
    2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919216
    J. Kovac, M. Dias Vieira Braga, and J. Stoye, “The Problem of Chromosome Reincorporation in DCJ Sorting and Halving”, Proc. of Recomb-CG 2010, LNBI, vol. 6398, 2010, pp.13-24.
    PUB | DOI
     
  • [4]
    2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898025
    M. Dias Vieira Braga and J. Stoye, “The Solution Space of Sorting by DCJ”, Journal of Computational Biology, vol. 17, 2010, pp. 1145-1165.
    PUB | DOI | WoS | PubMed | Europe PMC
     
  • [3]
    2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919215
    M. Dias Vieira Braga, E. Willing, and J. Stoye, “Genomic Distance with DCJ and Indels”, Proc. of WABI 2010, LNBI, vol. 6293, 2010, pp.90-101.
    PUB | DOI
     
  • [2]
    2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919206
    M. Dias Vieira Braga and J. Stoye, “Counting All DCJ Sorting Scenarios”, Proc. of Recomb-CG 2009, LNBI, vol. 5817, 2009, pp.36-47.
    PUB | DOI
     
  • [1]
    2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1588760 OA
    M. Dias Vieira Braga, C. Gautier, and M.-F. Sagot, “An asymmetric approach to preserve common intervals while sorting by reversals”, Algorithms for Molecular Biology, vol. 4, 2009, pp. 16.
    PUB | PDF | DOI | WoS | PubMed | Europe PMC
     
Markierte Publikation(en)

Suche

Publikationen filtern

Darstellung / Sortierung

Export / Einbettung