Cargando…
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
BACKGROUND: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. However, this phylogenetic reconstruction is a very challenging task. For the most simple distance measures (the breakpoint d...
Autores principales: | Bader, Martin, Abouelhoda, Mohamed I, Ohlebusch, Enno |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2008
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2655097/ https://www.ncbi.nlm.nih.gov/pubmed/19055792 http://dx.doi.org/10.1186/1471-2105-9-516 |
Ejemplares similares
-
CoCoNUT: an efficient system for the comparison and analysis of genomes
por: Abouelhoda, Mohamed I, et al.
Publicado: (2008) -
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
por: Beller, Timo, et al.
Publicado: (2016) -
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
por: Beller, Timo, et al.
Publicado: (2016) -
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
por: Logsdon, Benjamin A, et al.
Publicado: (2010) -
Analysis of RNA base modification and structural rearrangement by single-molecule real-time detection of reverse transcription
por: Vilfan, Igor D, et al.
Publicado: (2013)