Algorithms for subsequence combinatorics

Theoretical Computer Science

Volumn 409, Issue 3, 2008, Pages 394-404

  Elzinga, Cees ^a   Rahmann, Sven ^b   Wang, Hui ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b TU DORTMUND UNIVERSITY   (Germany)

^c UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

Algorithm; Combinatorics; Dynamic programming; Subsequence

Indexed keywords

COMPUTER PROGRAMMING; DYNAMIC PROGRAMMING; INFORMATION THEORY; LEARNING SYSTEMS; PROGRAMMING THEORY; SYSTEMS ENGINEERING;

BIOLOGICAL SEQUENCE ANALYSIS; CODING THEORIES; COMBINATORICS; COMMON SUBSEQUENCES; DYNAMIC PROGRAMMING ALGORITHMS; EMBEDDINGS; MACHINE LEARNINGS; SUBSEQUENCE; SUBSTRING; TIME SERIES;

TIME SERIES ANALYSIS;

EID: 56149092826     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.035     Document Type: Article

References (29)

1. Andrews G.E. The Theory of Partitions (1998), Cambridge University Press, Cambridge, UK
2. Anisiu M.-C., Blázsik Z., and Kása Z. Maximal Complexity of Finite Words. Pure Mathematics and Applications 13 1-2 (2002) 39-48
3. Bergroth L., Hakonen H., and Raita T. A survey of longest common subsequence algorithms. Proceedings of the Seventh International Symposium on String Processing and Information Retrieval. SPIRE'00 (2000), IEEE Computer Society 39-48
4. Bergroth L., Hakonen H., and Väisänen J. New refinement techniques for longest common subsequence algorithms. In: Nascimento M.A., Silvo de Moura E., and Oliveira A.L. (Eds). String processing and Information Retrieval, 10th International Symposium. SPIRE 2003 (2003), Springer, New York 287-303
5. Chase P. Subsequence numbers and logarithmic concavity. Discrete Mathematics 16 (1976) 123-140
6. Crochemore M., and Rytter W. Text Algorithms (1994), Oxford University Press, New York
7. de Luca A. On the combinatorics of finite words. Theoretical Computer Science 218 (1999) 13-39
8. Elzinga C.H. Combinatorial representation of token sequences. Journal of Classification 22 1 (2005) 87-118
9. C.H. Elzinga, Turbulence in categorical time series, Sociological Methods & Research (submitted for publication)
10. Elzinga C.H., and Liefbroer A.C. De-standardization and differentiation of family life trajectories of young adults: A cross-national comparison using sequence analysis. European Journal of Population 23 3-4 (2007) 225-250
11. Ferenczi S., and Kása Z. Complexity for finite factors of infinite sequences. Theoretical Computer Science 218 (1999) 177-195
12. Flaxman A., Harrow A.W., and Sorkin G.B. Strings with maximally many distict subsequences and substrings. The Electronic Journal of Combinatorics 11 (2004) R8
13. R.I. Greenberg, Computing the number of longest common subsequences, Computational Science Research Repository. arXiv:cs/0301034v1[cs.DS] (http://arxiv.org/abs/cs/0301034), 2003
14. Gusfield D. Algorithms on Strings, Trees and Sequences, Computer Science and Computational Biology (1997), Cambridge University Press, Cambridge, UK
15. Hirschberg D.S. Algorithms for the longest common subsequence problem. Journal of the ACM 24 4 (1977) 664-675
16. Hirschberg D.S., and Regnier M. Tight bounds on the number of string subsequences. Journal of Discrete Algorithms 1 1 (2000) 123-132
17. Iványi A. On the d-complexity of words, Annales "Universitatis Scientiarum Budapestinensis de Rolando Eötvös nominatae. Sectio Computatorica 8 (1987) 69-90
18. Kása Z. On the d-complexity of strings. Pure Mathematics and Applications 9 1-2 (1998) 119-128
19. Levé F., and Séébold P. Proof of a conjecture on word complexity. Bulletin of the Belgian Mathematical Society Simon Stevin 8 2 (2001) 277-291
20. Levenshtein V.I. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10 (1966) 707-710
21. Levenshtein V.I. On perfect codes in insertion and deletion metric. Discrete Mathematics and Applications 2 3 (1992) 241-258
22. Levenshtein V.I. Efficient reconstruction of sequences from their subsequences or supersequences. Journal of Combinatorial Theory, Series A 93 2 (2001) 310-332
23. Lothaire M. Combinatorics on Words. The Encyclopedia of Mathematics and its Applications vol. 17 (1983), Addison-Wesley, Reading, MA
24. Lothaire M. Algebraic Combinatorics on Words. The Encyclopedia of Mathematics and its Applications vol. 90 (2002), Cambridge University Press, Cambridge, UK
25. Rahmann S. Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms. In: Lewenstein M., and Valiente G. (Eds). Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science (LNCS) vol. 4009 (2006), Springer, New York 153-164
26. Sakarovitch J., and Simon I. Subwords. In: Lothaire M. (Ed). Combinatorics on Words (1983), Addison-Wesley, Reading, MA (Chapter 6)
27. Salomaa A. Counting (scatterred) subwords. Bulletin of the European Association for Theoretical Computer Science 81 (2003) 165-179
28. Swart T.G., and Ferreira H.C. A note on double insertion/deletion correcting codes. IEEE Transaction on Information Theory 49 1 (2003) 269-273
29. H. Wang, All common subsequences, in: M.M. Veloso (Ed.), IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007