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

Iliopoulos, Costas S.; Makris, Christos; Panagis, Yiannis; Perdikuri, Katerina; Theodoridis, Evangelos; Tsakalidis, Athanasios

by Costas S. Iliopoulos, Christos Makris, Yiannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios Tsakalidis

Reference:

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications (Costas S. Iliopoulos, Christos Makris, Yiannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios Tsakalidis), In Fundamenta Informaticae, volume 71, 2006.

Bibtex Entry:

@string{fi="Fundamenta Informaticae"}
@ARTICLE{IMPPTT06WeightSuffTree,
  AUTHOR =       "Costas S. Iliopoulos and Christos Makris and Yiannis Panagis and Katerina Perdikuri and Evangelos Theodoridis and Athanasios Tsakalidis",
  TITLE =        "The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications",
  JOURNAL =      FI,
  YEAR =         "2006",
  volume =       "71",
  number =       "2-3",
  pages =        "259--277",
}