Marília D. V. Braga

Orcid: 0000-0003-3558-6059

Affiliations:
  • Bielefeld University, CeBiTec, Germany


According to our database1, Marília D. V. Braga authored at least 40 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Investigating the complexity of the double distance problems.
Algorithms Mol. Biol., December, 2024

2023
Efficient gene orthology inference via large-scale rearrangements.
Algorithms Mol. Biol., December, 2023

On the Class of Double Distance Problems.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

2022
Gene Orthology Inference via Large-Scale Rearrangements for Partially Assembled Genomes.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

2021
Computing the Inversion-Indel Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Computing the Rearrangement Distance of Natural Genomes.
J. Comput. Biol., 2021

The potential of family-free rearrangements towards gene orthology inference.
J. Bioinform. Comput. Biol., 2021

Natural family-free genomic distance.
Algorithms Mol. Biol., 2021

2018
Computing the family-free DCJ similarity.
BMC Bioinform., 2018

2017
Genomic Distance with High Indel Costs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Approximating the DCJ distance of balanced genomes in linear time.
Algorithms Mol. Biol., 2017

Algorithms for Computing the Family-Free Genomic Similarity Under DCJ.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2016
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

2015
Sorting Linear Genomes with Rearrangements and Indels.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

On the family-free DCJ distance and similarity.
Algorithms Mol. Biol., 2015

2014
On the Family-Free DCJ Distance.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
On the inversion-indel distance.
BMC Bioinform., 2013

DCJ-indel and DCJ-substitution distances with distinct operation costs.
Algorithms Mol. Biol., 2013

Restricted DCJ-Indel Model Revisited.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2013

An Overview of Genomic Distances Modeled with Indels.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

The Potential of Family-Free Genome Comparison.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
BMC Bioinform., 2012

DCJ-indel Distance with Distinct Operation Costs.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation.
J. Comput. Biol., 2011

Double Cut and Join with Insertions and Deletions.
J. Comput. Biol., 2011

On the weight of indels in genomic distances.
BMC Bioinform., 2011

Genomic distance under gene substitutions.
BMC Bioinform., 2011

Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

2010
The Solution Space of Sorting by DCJ.
J. Comput. Biol., 2010

Repetition-free longest common subsequence.
Discret. Appl. Math., 2010

Genomic Distance with DCJ and Indels.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

The Problem of Chromosome Reincorporation in DCJ Sorting and Halving.
Proceedings of the Comparative Genomics - International Workshop, 2010

On Sorting Genomes with DCJ and Indels.
Proceedings of the Comparative Genomics - International Workshop, 2010

2009
<tt>baobabLUNA</tt>: the solution space of sorting by reversals.
Bioinform., 2009

An asymmetric approach to preserve common intervals while sorting by reversals.
Algorithms Mol. Biol., 2009

Counting All DCJ Sorting Scenarios.
Proceedings of the Comparative Genomics, International Workshop, 2009

2008
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

2007
The Solution Space of Sorting by Reversals.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2002
An Algorithm That Builds a Set of Strings Given Its Overlap Graph.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002


  Loading...