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

Iliopoulos, Costas S. and Makris, C. and Panagis, Y. and Perdikuri, Katerina and Theodoridis, E. and Tsakalidis, A. (2006) The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundamenta Informaticae, 71 (2-3). pp. 259-277.

Full text not available from this repository.

Item Type:	Article
Subjects:	UNSPECIFIED
ID Code:	1115
Deposited By:	Professor Michael Luck
Deposited On:	13 Nov 2007 18:21
Last Modified:	13 Nov 2007 18:21

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007