Genome rearrangements: a correct algorithm for optimal capping
Idioma
en
Article de revue
Este ítem está publicado en
Information Processing Letters. 2007, vol. 104, n° 1, p. 14-20
Elsevier
Resumen en inglés
In this Letter we propose two results in application to rearrangements of multichromosomal genomes: first, a literature synthesis providing a classification for breakpoint graph components; and second, a new algorithm for ...Leer más >
Palabras clave en inglés
Algorithms
Genome rearrangements
Breakpoint graph
Genomic distance
Optimal capping