The suffix binary search tree and suffix AVL tree

Author： Irving R.W.   Love L.  

Publisher： Elsevier

ISSN： 1570-8667

Source： Journal of Discrete Algorithms, Vol.1, Iss.5, 2003-10, pp. : 387-408

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On-line Construction of Two-Dimensional Suffix Trees

By Giancarlo R.   Guaiana D.  

Journal of Complexity, Vol. 15, Iss. 1, 1999-03 ,pp. : 72-127

Academic Press

Access to resources Recommend Favorite

A Tree That's Not a Tree

By Naimi Ramin  

Mathematics Magazine, Vol. 79, Iss. 5, 2006-12 ,pp. : 367-367

Mathematical Association of America

Access to resources Recommend Favorite

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications

By Giancarlo R.   Grossi R.  

Information and Computation, Vol. 130, Iss. 2, 1996-11 ,pp. : 151-182

Academic Press

Access to resources Recommend Favorite

Markov approximation and consistent estimation of unbounded probabilistic suffix trees

By Duarte Denise   Galves Antonio   Garcia Nancy  

Bulletin of the Brazilian Mathematical Society, Vol. 37, Iss. 4, 2006-12 ,pp. : 581-592

Springer Publishing Company

Access to resources Recommend Favorite

Pick a Tree – Any Tree

By Chin Alex   Gordon Gary   MacPhee Kellie   Vincent Charles  

American Mathematical Monthly, Vol. 122, Iss. 5, 2015-05 ,pp. : 424-432

Mathematical Association of America

Access to resources Recommend Favorite