We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Murasaki: a fast, parallelizable algorithm to find anchors from multiple genomes.
- Authors
Popendorf, Kris; Tsuyoshi, Hachiya; Osana, Yasunori; Sakakibara, Yasubumi
- Abstract
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 identify sets of short well-conserved sequences present in each genome, termed anchors. Previously, anchor identification among multiple genomes has been achieved using pairwise alignment tools like BLASTZ through progressive alignment tools like TBA, but the computational requirements for sequence comparisons of multiple genomes quickly becomes a limiting factor as the number and scale of genomes grows.
- Publication
PloS one, 2010, Vol 5, Issue 9, pe12651
- ISSN
1932-6203
- Publication type
Journal Article
- DOI
10.1371/journal.pone.0012651