Inferring Strings from Graphs and Arrays-Reference-Cited by-同舟云学术

Inferring Strings from Graphs and Arrays

Published:2003 Issue: Volume: Page:208-217
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2003
language:
Short-container-title:

Author:

Bannai Hideo,Inenaga Shunsuke,Shinohara Ayumi,Takeda Masayuki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45138-9_15

Reference13 articles.

1. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)

2. Baeza-Yates, R.A.: Searching subsequences (note). Theoretical Computer Science 78, 363–376 (1991)

3. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science 40, 31–55 (1985)

4. Franěk, F., Gao, S., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a border array in linear time. J. Comb. Math. Comb. Comput., 223–236 (2002)

5. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)

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

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

2. Inferring Strings from Position Heaps in Linear Time;WALCOM: Algorithms and Computation;2023

3. Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays;String Processing and Information Retrieval;2022

4. Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info;International Journal of Foundations of Computer Science;2019-09

5. Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays;String Processing and Information Retrieval;2018