Murasaki: A Fast, Parallelizable Algorithm to Find Anchors from Multiple Genomes

BACKGROUND: With the number of available genome sequences increasing rapidly, the magnitude of sequence data required for multiple-genome analyses is a challenging problem. When large-scale rearrangements break the collinearity of gene orders among genomes, genome comparison algorithms must first id...

Descripción completa

Detalles Bibliográficos
Autores principales: Popendorf, Kris, Tsuyoshi, Hachiya, Osana, Yasunori, Sakakibara, Yasubumi
Formato: Texto
Lenguaje:English
Publicado: Public Library of Science 2010
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2945767/
https://www.ncbi.nlm.nih.gov/pubmed/20885980
http://dx.doi.org/10.1371/journal.pone.0012651

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2945767/
https://www.ncbi.nlm.nih.gov/pubmed/20885980
http://dx.doi.org/10.1371/journal.pone.0012651

Ejemplares similares