Bounding the expected length of longest common subsequences and forests

Theory of Computing Systems

Volumn 32, Issue 4, 1999, Pages 435-452

  Baeza Yates, R A ^a   Gavalda R ^b   Navarro, G ^a   Scheihing, R ^a  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

EXACT RESULTS; EXPECTED LENGTH; FIXED SIZE; KOLMOGOROV COMPLEXITY; LONGEST COMMON SUBSEQUENCES; LOWER AND UPPER BOUNDS; RANDOM SEQUENCE; SHORT SEQUENCES;

FORESTRY;

EID: 0033419390     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000125     Document Type: Article

References (19)

1. R. Baeza-Yates, R. Gavaldá, and G. Navarro. Bounding the expected length of longest common subsequences and forests. In R. Baeza-Yates, N. Ziviani, and K. Guimarães, editors, Proc. WSP '96, pages 1-15, Recife, Brazil, August 1996.
2. R. Baeza-Yates and R. Scheihing. New lower bounds for the expected length of longest common subsequences and forests. In Proc. XV International Conference of the Chilean Computer Science Society, pages 48-58, Arica, Chile, November 1995.
3. B. Char, G. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt. MAPLE V Language and Library Reference Manual. Springer-Verlag, New York, 1991.
4. D. Cox and H. Miller. The Theory of Stochastic Processes. Chapman and Hall, London, 1965.
5. V. Chvátal and D. Sankoff. Longest common subsequences of two random sequences. Journal of Applied Probability, 12:306-315, 1975.
6. V. Chvátal and D. Sankoff. An upper-bound technique for lengths of common subsequences. In D. Sankoff and J. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pages 353-357. Addison-Wesley, Reading, MA, 1983.
7. V. Dančík. Expected Length of Longest Common Subsequences. Ph.D. Thesis, CS Dept., Univ. of Warwick, Warwick, England, 1994.
8. V. Dančík. Common subsequences and supersequences and their expected length. In Z. Galil and E. Ukkonen, editors, Proc. 6th Annual Symposium on Combinatorial Pattern Matching, pages 55-63, Espoo, Finland, July 1995. LNCS 937, Springer-Verlag, Berlin, 1995.
9. J. Deken. Some limit results for longest common subsequences. Discrete Mathematics, 26:17-31, 1979.
10. J. Deken. Probabilistic behavior of longest-common subsequence length. In D. Sankoff and J. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pages 359-362. Addison-Wesley, Reading, MA, 1983.
11. V. Dančík and M. Paterson. Upper bounds for the expected length of a longest common subsequence of two binary sequences. Random Structures & Algorithms, 6:449-458, 1995.
12. G.H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures - In Pascal and C, second edition. Addison-Wesley, Workingham, England, 1991.
13. T. Jiang and M. Li. On the approximation of shortest common supersequence and longest common subsequences. SIAM Journal on Computing, 24(5): 1112-1139, Oct 1995.
14. M. Li and P. Vitányi. An Introduction to Kolomogorov Complexity and Its Applications, second edition. Springer-Verlag, New York, 1997.
15. D. Maier. The complexity of some problems on subsequences and supersequences. Journal of the ACM, 25:322-336, 1978.
16. M. Paterson and V. Dančík. Longest common subsequences. In B. Rovan, I. Privara, and P. Ruzicka, editors, Proc. 19th MFCS '94, pages 127-142, Kosice, Slovakia, August 1994. LNCS 841, Springer Verlag, Berlin, 1994.
17. P. Pevzner and M. Waterman. Generalized sequence alignment and duality. Advances in Applied Mathematics, 14:139-171, 1993.
18. C. Rick. A new flexible algorithm for the longest common subsequence problem. In Proc. 6th Annual Symposium on Combinatorial Pattern Matching, pages 340-351, Espoo, Finland, 1995. LNCS 937, Springer-Verlag, Berlin, 1995.
19. D. Sankoff and S. Mainville. Common subsequences and monotone susequences. In D. Sankoff and J. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pages 363-365. Addison-Wesley, Reading, MA, 1983.