Efficient Enumeration of Phylogenetically Informative Substrings

@article{Angelov2006EfficientEO,
  title={Efficient Enumeration of Phylogenetically Informative Substrings},
  author={Stanislav Angelov and Boulos Harb and Sampath Kannan and Sanjeev Khanna and Junhyong Kim},
  journal={Journal of computational biology : a journal of computational molecular cell biology},
  year={2006},
  volume={14 6},
  pages={701-23}
}
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore conserved) substrings that are shared between all mammals and not found in non-mammals. Such collection of substrings may be used to identify conserved subsequences or to construct sets of identifying substrings for branches of a phylogenetic tree. For two disjoint sets of genomes on a phylogenetic tree, a substring is… CONTINUE READING