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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Main Authors: Popendorf, Kris, Tsuyoshi, Hachiya, Osana, Yasunori, Sakakibara, Yasubumi
Format: Artigo
Jezik:Inglês
Izdano: Public Library of Science 2010
Teme:
Research Article
Online dostop:https://ncbi.nlm.nih.gov/pmc/articles/PMC2945767/
https://ncbi.nlm.nih.gov/pubmed/20885980
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0012651
Oznake: Označite
Brez oznak, prvi označite!

Podobne knjige/članki