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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Costas S. Iliopoulos' in GoogleThis author has not been identified. It may be one of the following persons:

Christos Makris

Look up 'Christos Makris' in GoogleThis author has not been identified. Look up 'Yannis Panagis' in GoogleThis author has not been identified. Look up 'Katerina Perdikuri' in GoogleThis author has not been identified. Look up 'Evangelos Theodoridis' in GoogleThis author has not been identified. Look up 'Athanasios K. Tsakalidis' in Google

runs on WebDSL