Cover Array String Reconstruction-Reference-Cited by-同舟云学术

Cover Array String Reconstruction

Published:2010 Issue: Volume: Page:251-259
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Crochemore Maxime,Iliopoulos Costas S.,Pissis Solon P.,Tischler German

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13509-5_23.pdf

Reference12 articles.

1. Lecture Notes in Computer Science;A. Apostolico,1997

2. Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theoretical Computer Science 119(2), 247–265 (1993)

3. Lecture Notes in Computer Science;H. Bannai,2003

4. Breslauer, D.: An on-line string superprimitivity test. Information Processing Letters 44(6), 345–347 (1992)

5. Clement, J., Crochemore, M., Rindone, G.: Reverse engineering prefix tables. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Dagstuhl, Germany, pp. 289–300. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009), http://drops.dagstuhl.de/opus/volltexte/2009/1825

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On suffix tree detection;Theoretical Computer Science;2024-10

2. String Covering: A Survey;Fundamenta Informaticae;2023-10-27

3. String inference from longest-common-prefix array;Theoretical Computer Science;2023-01

4. On Suffix Tree Detection;String Processing and Information Retrieval;2023

5. Experimental evaluation of algorithms for computing quasiperiods;Theoretical Computer Science;2021-01