Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 85, 2008 - Issue 2
Submit an article Journal homepage
43
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Generalized approximate regularities in strings

Hui Zhang Department of Computer Science, King's College London, Strand, London, WC2R 2LS, UK; College of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou, Zhejiang, 310018, P.R. ChinaCorrespondence[email protected]
,
Qing Guo Department of Computer Science and Engineering, Zhejiang University, Hangzhou, Zhejiang, 310027, P.R. China
&
Costas S. Iliopoulos College of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou, Zhejiang, 310018, P.R. China
Pages 155-168 | Received 13 Jan 2006, Accepted 29 Mar 2007, Published online: 02 Oct 2008

References

  • Apostolico , A. , Farach , M. and Iliopoulos , C. S. 1991 . Optimal superprimitivity testing for strings . Information Processing Letters , 39 : 17 – 20 .
  • Breslauer , D. 1992 . An on-line string superprimitivity test . Information Processing Letters , 44 : 345 – 347 .
  • Moore , D. W.G. and Smyth , W. F. 1995 . A correction to ‘Computing the covers of a string in linear time’ . Information Processing Letters , 54 : 101 – 103 .
  • Li , Y. and Smyth , W. F. 2002 . Computing the cover array in linear time . Algorithmica , 32 ( 1 ) : 95 – 106 .
  • Iliopoulos , C. S. and Park , K. 1996 . A work-time optimal algorithm for computing all string covers . Theoretical Computer Science , 2 : 299 – 310 .
  • Iliopoulos , C. S. , Moore , D. W.G. and Park , K. 1996 . Covering a string . Algorithmica , 16 : 288 – 297 .
  • Ben-Amram , A. M. , Berkman , O. , Iliopoulos , C. S. and Park , K. 1995 . The subtree max gap problem with application to parallel string covering . Information and Computation , 123 : 127 – 137 .
  • Guo , Q. , Zhang , H. and Iliopoulos , C. S. 2007 . Computing the λ-covers of a string . Information Sciences , 177 : 3957 – 3967 .
  • Guo , Q. , Zhang , H. and Iliopoulos , C. S. Computing the λ-seeds of a string . Proceedings of the 2nd International Conferences on Algorithmic Aspects in Information and Management (AAIM ’06) . Berlin. Vol. 4041 , pp. 303 – 313 . Springer Verlag . Lecture Notes in Computer Science
  • Sim , J. S. , Iliopoulos , C. S. , Park , K. and Smith , W. F. 2001 . Approximate periods of strings . Theoretical Computer Science , 262 : 557 – 568 .
  • Sim , J. S. , Park , K. , Kim , S. and Lee , J. 2002 . Finding approximate covers of strings . Journal of Korea Information Science Society , 29 ( 1 ) : 16 – 21 .
  • Christodoulakis , M. , Iliopoulos , C. S. , Park , K. and Sim , J. S. Approximate seeds of strings . Proceedings of the 2003 Prague Stringology Conference PSC’03 . Prague:. pp. 25 – 36 . CTU .
  • Kim , S. and Park , K. A dynamic edit distance table . Proceedings of the 11th Symposium on Combinatorial Pattern Matching . Berlin:. Vol. 1848 , pp. 60 – 68 . Springer-Verlag . Lecture Notes in Computer Science
  • Crochemore , M. 1981 . An Optimal Algorithm for Computing the Repetitions in a Word . Information Processing Letters , 12 : 244 – 250 .
  • Apostolico , A. and Preparata , F. P. 1983 . Optimal off-line detection of repetitions in a string . Theoretical Computer Science , 22 : 297 – 315 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.