Varieties of Regularities in Weighted Sequences-Reference-Cited by-同舟云学术

Varieties of Regularities in Weighted Sequences

Published:2010 Issue: Volume: Page:271-280
ISSN:0302-9743
Container-title:Algorithmic Aspects in Information and Management
language:
Short-container-title:

Author:

Zhang Hui,Guo Qing,Iliopoulos Costas S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14355-7_28.pdf

Reference15 articles.

1. Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gap. Journal of Discrete Algorithms, Special Issue of Matching Patterns 1(1), 77–104 (2000)

2. Christodoulakis, M., Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A., Tsichlas, K.: Computation of repetitions and regularities on biological weighted sequences. Journal of Computational Biology 13(6), 1214–1231 (2006)

3. Lecture Series on Computer and Computational Sciences;M. Christodoulakis,2004

4. Crochemore, M.: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letter 12(5), 244–250 (1981)

5. Franêk, F., Smyth, W.F., Tang, Y.: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4), 579–591 (2003)

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

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

2. Approximating the Anticover of a String;String Processing and Information Retrieval;2020

3. Approximate cover of strings;Theoretical Computer Science;2019-11

4. Can We Recover the Cover?;Algorithmica;2019-03-22

5. Crochemore’s Partitioning on Weighted Strings and Applications;Algorithmica;2017-01-27