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...
Gardado en:
| Main Authors: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Public Library of Science
2010
|
| Assuntos: | |
| Acceso en liña: | 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 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|