The Potential of Family-Free Genome Comparison
From MaRDI portal
Publication:4992763
DOI10.1007/978-1-4471-5298-9_13zbMath1462.92037OpenAlexW1481103812MaRDI QIDQ4992763
Marília D. V. Braga, Daniel Doerr, Cedric Chauve, Katharina Jahn, Jens Stoye, Annelyse Thévenin, et d'autres.
Publication date: 10 June 2021
Published in: Models and Algorithms for Genome Evolution (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4471-5298-9_13
Uses Software
Cites Work
- Models and algorithms for genome evolution. Selected contributions based on the presentations at the MAGE conference, Montréal, Canada, August 23--26, 2013
- Common intervals of multiple permutations
- Fast algorithms to enumerate all common intervals of two permutations
- Character sets of strings
- The Reversal Median Problem
- Transforming cabbage into turnip
- On the Approximability of Comparing Genomes with Duplicates
- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
- Algorithms for Finding Gene Clusters
- Combinatorial Pattern Matching
- Research in Computational Molecular Biology
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Potential of Family-Free Genome Comparison