Fast algorithms for computing sequence distances by exhaustive substring composition
<p>Abstract</p> <p>The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reconstruction. Such needs are hardly fulfilled by the more traditional measures of sequ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2008-10-01
|
| Series: | Algorithms for Molecular Biology |
| Online Access: | http://www.almob.org/content/3/1/13 |