Inferring strings from graphs and arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 208-217

  Bannai, Hideo ^a   Inenaga, Shunsuke ^b   Shinohara, Ayumi ^b,c   Takeda, Masayuki ^b,c  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY;

DIRECTED ACYCLIC SUBSEQUENCE GRAPH; DIRECTED ACYCLIC WORD GRAPHS; GRAPH G; INPUT SIZE; LINEAR TIME; SUFFIX ARRAYS;

PROBLEM SOLVING;

EID: 13644264108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_15     Document Type: Article

References (13)

1. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2002)
2. Baeza-Yates, R.A.: Searching subsequences (note). Theoretical Computer Science 78 (1991) 363-376
3. Blumer, A., Blumer, J., Haussier, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science 40 (1985) 31-55
4. Franěk, P., 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. (2002) 223-236
5. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley (1974)
6. Duval, J.P., Lecroq, T., Lefevre, A.: Border array on bounded alphabet. In: Proc. The Prague Stringology Conference '02 (PSC'02), Czech Technical University (2002) 28-35
7. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Compt. 22 (1993) 935-948
8. Atallah, M.J., ed.: Algorithms and Theory of Computation Handbook. CRC Press (1998) ISBN:0-8493-2649-4.
9. Crochemore, M.: Transducers and repetitions. Theoretical Computer Science 45 (1986) 63-86
10. Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics (2nd edition). Addison Wesley (1994)
11. Allauzen, C., Crochemore, M., Raffinot, M.: Factor oracle: A new structure for pattern matching. In: Proc. 26th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'99). Volume 1725 of LNCS., Springer-Verlag (1999) 291-306
12. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Annual Symposium on Switching and Automata Theory. (1973) 1-11
13. Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM 34 (1987) 578-595