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

Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis. The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundamenta Informaticae, 71(2-3):259-277, 2006. [doi]

@article{IliopoulosMPPTT06,
  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},
  year = {2006},
  url = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=71&issue=2&spage=259},
  researchr = {https://researchr.org/publication/IliopoulosMPPTT06},
  cites = {0},
  citedby = {0},
  journal = {Fundamenta Informaticae},
  volume = {71},
  number = {2-3},
  pages = {259-277},
}