Author： Apostolico A. Breslauer D. Galil Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.141, Iss.1, 1995-04, pp. : 163-173
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
Fast parallel string prefix-matching
By Breslauer D.
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :
Access to resources
Recommend
A work-time optimal algorithm for computing all string covers
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
A note on differentiable palindromes
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Palindromes and Sturmian words
Theoretical Computer Science, Vol. 223, Iss. 1, 1999-07 ,pp. :
Watson–Crick palindromes in DNA computing
By Kari Lila Mahalingam Kalpana
Natural Computing, Vol. 9, Iss. 2, 2010-06 ,pp. :