The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications

@article{Iliopoulos2006TheWS,
  title={The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications},
  author={Costas S. Iliopoulos and Christos Makris and Yannis Panagis and Katerina Perdikuri and Evangelos Theodoridis and Athanasios K. Tsakalidis},
  journal={Fundam. Inform.},
  year={2006},
  volume={71},
  pages={259-277}
}
In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Weighted Sequences can model important biological processes such as the DNA Assembly Process or the DNA-Protein Binding Process. Thus pattern matching or identification of repeated patterns, in biological weighted sequences is a very important procedure in the translation of gene expression and regulation. We present time and space… CONTINUE READING