Fast algorithms for large-scale genome alignment and comparison
We describe a suffix-tree algorithm that can align the entire genome sequences of eukaryotic and prokaryotic organisms with minimal use of computer time and memory. The new system, MUMmer 2, runs three times faster while using one-third as much memory as the original MUMmer system. It has been used...
Spremljeno u:
| Izdano u: | Nucleic Acids Res |
|---|---|
| Glavni autori: | , , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Oxford University Press
2002
|
| Teme: | |
| Online pristup: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC117189/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/12034836/ https://ncbi.nlm.nih.govhttps://doi.org/10.1093/nar/30.11.2478 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|