Cargando…
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance
Finding the smallest sequence of operations to transform one genome into another is an important problem in comparative genomics. The breakpoint graph is a discrete structure that has proven to be effective in solving distance problems, and the number of cycles in a cycle decomposition of this graph...
Autores principales: | Feijão, Pedro, Martinez, Fábio Viduani, Thévenin, Annelyse |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4686795/ https://www.ncbi.nlm.nih.gov/pubmed/26695008 http://dx.doi.org/10.1186/1471-2105-16-S19-S1 |
Ejemplares similares
-
Multichromosomal median and halving problems under different genomic distances
por: Tannier, Eric, et al.
Publicado: (2009) -
Linearization of ancestral multichromosomal genomes
por: Maňuch, Ján, et al.
Publicado: (2012) -
Approximating the DCJ distance of balanced genomes in linear time
por: Rubert, Diego P., et al.
Publicado: (2017) -
Cassis: detection of genomic rearrangement breakpoints
por: Baudet, Christian, et al.
Publicado: (2010) -
Precise detection of rearrangement breakpoints in mammalian chromosomes
por: Lemaitre, Claire, et al.
Publicado: (2008)