Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The Enhanced Suffix Array and Its Applications to Genome Analysis
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Clustal W and Clustal X version 2.0
Bioinformatics
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Hi-index | 0.00 |
Phylogeny reconstruction on a genome scale remains computationally challenging even for closely related organisms. Here we propose an alignment-free pairwise distance measure, Kr, for genomes separated by less than approximately 0.5 mismatches/nucleotide. We have implemented the computation of Krbased on enhanced suffix arrays in the program kr, which is freely available from guanine.evolbio.mpg.de/kr/. The software is applied to genomes obtained from three sets of taxa: 27 primate mitochondria, eight Staphylococcus agalactiaestrains, and 12 Drosophilaspecies. Subsequent clustering of the Krvalues always recovers phylogenies that are similar or identical to the accepted branching order.