"The Weighted Suffix Tree: An Efficient Data Structure for Handling ..."

Costas S. Iliopoulos et al. (2006)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2024-07-01

- view
  - electronic edition @ iospress.com
- export record
  dblp key:
  - journals/fuin/IliopoulosMPPTT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/IliopoulosMPPTT06
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. Fundam. Informaticae 71(2-3): 259-277 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.