default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarília D. V. Braga
Person information
- affiliation: Bielefeld University, CeBiTec, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
Investigating the complexity of the double distance problems. Algorithms Mol. Biol. 19(1): 1 (2024)- 2023
- [j23]Diego P. Rubert
, Marília D. V. Braga:
Efficient gene orthology inference via large-scale rearrangements. Algorithms Mol. Biol. 18(1): 14 (2023) - [c18]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
On the Class of Double Distance Problems. RECOMB-CG 2023: 35-50 - [i4]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
Investigating the complexity of the double distance problems. CoRR abs/2303.04205 (2023) - 2022
- [c17]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. WABI 2022: 13:1-13:16 - [c16]Diego P. Rubert, Marília D. V. Braga:
Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes. WABI 2022: 24:1-24:22 - 2021
- [j22]Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga:
Natural family-free genomic distance. Algorithms Mol. Biol. 16(1): 4 (2021) - [j21]Diego P. Rubert, Daniel Doerr, Marília D. V. Braga:
The potential of family-free rearrangements towards gene orthology inference. J. Bioinform. Comput. Biol. 19(6): 2140014:1-2140014:15 (2021) - [j20]Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr, Jens Stoye:
Computing the Rearrangement Distance of Natural Genomes. J. Comput. Biol. 28(4): 410-431 (2021) - [j19]Eyla Willing, Jens Stoye, Marília D. V. Braga:
Computing the Inversion-Indel Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2314-2326 (2021) - 2020
- [c15]Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr, Jens Stoye:
Computing the Rearrangement Distance of Natural Genomes. RECOMB 2020: 3-18 - [c14]Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga:
Natural Family-Free Genomic Distance. WABI 2020: 3:1-3:23 - [i3]Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr, Jens Stoye:
Computing the rearrangement distance of natural genomes. CoRR abs/2001.02139 (2020) - [i2]Diego P. Rubert, Fábio Viduani Martinez, Marília D. V. Braga:
Natural family-free genomic distance. CoRR abs/2007.03556 (2020)
2010 – 2019
- 2019
- [i1]Eyla Willing, Jens Stoye, Marília D. V. Braga:
Computing the Inversion-Indel Distance. CoRR abs/1909.12877 (2019) - 2018
- [j18]Diego P. Rubert, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
Computing the family-free DCJ similarity. BMC Bioinform. 19-S(6): 31-42 (2018) - 2017
- [j17]Diego P. Rubert, Pedro Feijão, Marília Dias Vieira Braga, Jens Stoye, Fábio Viduani Martinez:
Approximating the DCJ distance of balanced genomes in linear time. Algorithms Mol. Biol. 12(1): 3:1-3:13 (2017) - [j16]Poly H. da Silva, Raphael Machado, Simone Dantas, Marília D. V. Braga:
Genomic Distance with High Indel Costs. IEEE ACM Trans. Comput. Biol. Bioinform. 14(3): 728-732 (2017) - [c13]Diego P. Rubert, Gabriela Medeiros, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
Algorithms for Computing the Family-Free Genomic Similarity Under DCJ. RECOMB-CG 2017: 76-100 - 2016
- [c12]Diego P. Rubert, Pedro Feijão, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. WABI 2016: 293-306 - 2015
- [j15]Fábio Viduani Martinez, Pedro Feijão, Marília D. V. Braga, Jens Stoye:
On the family-free DCJ distance and similarity. Algorithms Mol. Biol. 10: 13 (2015) - [j14]Marília D. V. Braga, Jens Stoye:
Sorting Linear Genomes with Rearrangements and Indels. IEEE ACM Trans. Comput. Biol. Bioinform. 12(3): 500-506 (2015) - 2014
- [c11]Fábio Viduani Martinez, Pedro Feijão, Marília D. V. Braga, Jens Stoye:
On the Family-Free DCJ Distance. WABI 2014: 174-186 - 2013
- [j13]Poly H. da Silva, Raphael Machado, Simone Dantas, Marília D. V. Braga:
DCJ-indel and DCJ-substitution distances with distinct operation costs. Algorithms Mol. Biol. 8: 21 (2013) - [j12]Eyla Willing, Simone Zaccaria, Marília D. V. Braga, Jens Stoye:
On the inversion-indel distance. BMC Bioinform. 14(S-15): S3 (2013) - [c10]Marília D. V. Braga:
An Overview of Genomic Distances Modeled with Indels. CiE 2013: 22-31 - [c9]Marília D. V. Braga, Jens Stoye:
Restricted DCJ-Indel Model Revisited. BSB 2013: 36-46 - [p1]Marília D. V. Braga, Cédric Chauve, Daniel Doerr, Katharina Jahn, Jens Stoye, Annelyse Thévenin, Roland Wittler:
The Potential of Family-Free Genome Comparison. Models and Algorithms for Genome Evolution 2013: 287-307 - 2012
- [j11]Poly H. da Silva, Raphael Machado, Simone Dantas, Marília D. V. Braga:
Restricted DCJ-indel model: sorting linear genomes with DCJ and indels. BMC Bioinform. 13(S-19): S14 (2012) - [c8]Poly H. da Silva, Marília D. V. Braga, Raphael Machado, Simone Dantas:
DCJ-indel Distance with Distinct Operation Costs. WABI 2012: 378-390 - 2011
- [j10]Marília D. V. Braga, Raphael Machado, Leonardo Costa Ribeiro, Jens Stoye:
On the weight of indels in genomic distances. BMC Bioinform. 12(S-9): S13 (2011) - [j9]Marília D. V. Braga, Raphael Machado, Leonardo Costa Ribeiro, Jens Stoye:
Genomic distance under gene substitutions. BMC Bioinform. 12(S-9): S8 (2011) - [j8]Marília D. V. Braga, Eyla Willing, Jens Stoye:
Double Cut and Join with Insertions and Deletions. J. Comput. Biol. 18(9): 1167-1184 (2011) - [j7]Jakub Kovác, Robert Warren, Marília D. V. Braga, Jens Stoye:
Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation. J. Comput. Biol. 18(9): 1231-1241 (2011) - [c7]Marcelo P. Lopes, Marília D. V. Braga, Celina M. H. de Figueiredo, Rodrigo de A. Hausen, Luis Antonio Brasil Kowada:
Analysis and Implementation of Sorting by Transpositions Using Permutation Trees. BSB 2011: 42-49 - 2010
- [j6]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010) - [j5]Marília D. V. Braga, Jens Stoye:
The Solution Space of Sorting by DCJ. J. Comput. Biol. 17(9): 1145-1165 (2010) - [c6]Jakub Kovác, Marília D. V. Braga, Jens Stoye:
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. RECOMB-CG 2010: 13-24 - [c5]Marília D. V. Braga:
On Sorting Genomes with DCJ and Indels. RECOMB-CG 2010: 62-73 - [c4]Marília D. V. Braga, Eyla Willing, Jens Stoye:
Genomic Distance with DCJ and Indels. WABI 2010: 90-101
2000 – 2009
- 2009
- [j4]Marília D. V. Braga, Christian Gautier, Marie-France Sagot:
An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms Mol. Biol. 4: 16 (2009) - [j3]Marília D. V. Braga:
baobabLUNA: the solution space of sorting by reversals. Bioinform. 25(14): 1833-1835 (2009) - [c3]Marília D. V. Braga, Jens Stoye:
Counting All DCJ Sorting Scenarios. RECOMB-CG 2009: 36-47 - 2008
- [j2]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30: 243-248 (2008) - [j1]Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier:
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 348-356 (2008) - 2007
- [c2]Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier:
The Solution Space of Sorting by Reversals. ISBRA 2007: 293-304 - 2002
- [c1]Marília D. V. Braga, Joao Meidanis:
An Algorithm That Builds a Set of Strings Given Its Overlap Graph. LATIN 2002: 52-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
