![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Breslauer D.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.191, Iss.1, 1998-01, pp. : 131-144
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On updating suffix tree labels
By Ferragina P. Grossi R. Montangero M.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Iterated relabeling tree transducers
By Fulop
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Restricted ground tree transducers
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A suffix tree approach to anti-spam email filtering
Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Generalization of a Suffix Tree for RNA Structural Pattern Matching
Algorithmica, Vol. 39, Iss. 1, 2004-01 ,pp. :