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

Open Access

Peer-reviewed

Research Article

Kris Popendorf,

Affiliation Department of Biosciences and Informatics, Keio University, Yokohama, Japan
⨯
Hachiya Tsuyoshi,

Affiliation Department of Biosciences and Informatics, Keio University, Yokohama, Japan
⨯
Yasunori Osana,

Affiliation Department of Computer and Informatics Science, Seikei University, Musashino-shi, Tokyo, Japan
⨯
Yasubumi Sakakibara

* E-mail: yasu@bio.keio.ac.jp

Affiliation Department of Biosciences and Informatics, Keio University, Yokohama, Japan
⨯

Reader Comments (0)

Mammalian genomics
Is the Subject Area "Mammalian genomics" applicable to this article?

Thanks for your feedback.
Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Multiple alignment calculation
Is the Subject Area "Multiple alignment calculation" applicable to this article?

Thanks for your feedback.
Sequence alignment
Is the Subject Area "Sequence alignment" applicable to this article?

Thanks for your feedback.
X chromosomes
Is the Subject Area "X chromosomes" applicable to this article?

Thanks for your feedback.
Genomics
Is the Subject Area "Genomics" applicable to this article?

Thanks for your feedback.
BLAST algorithm
Is the Subject Area "BLAST algorithm" applicable to this article?

Thanks for your feedback.
Human genomics
Is the Subject Area "Human genomics" applicable to this article?

Thanks for your feedback.