Cargando…
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...
Autores principales: | Popendorf, Kris, Tsuyoshi, Hachiya, Osana, Yasunori, Sakakibara, Yasubumi |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2010
|
Materias: | |
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 |
Ejemplares similares
-
Whole genome assembly of a natto production strain Bacillus subtilis natto from very short read data
por: Nishito, Yukari, et al.
Publicado: (2010) -
An efficient algorithm for de novo predictions of biochemical pathways between chemical compounds
por: Nakamura, Masaomi, et al.
Publicado: (2012) -
A flexible and parallelizable approach to genome‐wide polygenic risk scores
por: Newcombe, Paul J., et al.
Publicado: (2019) -
Fundamental energy cost of finite-time parallelizable computing
por: Konopik, Michael, et al.
Publicado: (2023) -
MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads
por: Namiki, Toshiaki, et al.
Publicado: (2012)