Closeness to the diagonal for longest common subsequences in random words

Christian Houdré; Heinrich Matzinger

doi:10.1214/16-ecp4029

Closeness to the diagonal for longest common subsequences in random words

Electronic Communications in Probability ◽

10.1214/16-ecp4029 ◽

2016 ◽

Vol 21 (0) ◽

Cited By ~ 1

Author(s):

Christian Houdré ◽

Heinrich Matzinger

Keyword(s):

Longest Common Subsequences

Download Full-text

Performance analysis of some simple heuristics for computing longest common subsequences

Algorithmica ◽

10.1007/bf01185429 ◽

1994 ◽

Vol 12 (4-5) ◽

pp. 293-311 ◽

Cited By ~ 17

Author(s):

F. Chin ◽

C. K. Poon

Keyword(s):

Performance Analysis ◽

Longest Common Subsequences ◽

Simple Heuristics

Download Full-text

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-030-62867-3_11 ◽

2020 ◽

pp. 134-149

Author(s):

Matthias Horn ◽

Marko Djukanovic ◽

Christian Blum ◽

Günther R. Raidl

Keyword(s):

Decision Diagrams ◽

Longest Common Subsequences

Download Full-text

Constraint Based Periodic Pattern Mining in Multiple Longest Common Subsequences

Indian Journal of Science and Technology ◽

10.17485/ijst/2013/v6i8.13 ◽

2013 ◽

Vol 6 (8) ◽

pp. 1-12

Author(s):

G. M. Karthik

Keyword(s):

Pattern Mining ◽

Periodic Pattern ◽

Longest Common Subsequences

Download Full-text

A fast algorithm for computing longest common subsequences

Communications of the ACM ◽

10.1145/359581.359603 ◽

1977 ◽

Vol 20 (5) ◽

pp. 350-353 ◽

Cited By ~ 346

Author(s):

James W. Hunt ◽

Thomas G. Szymanski

Keyword(s):

Fast Algorithm ◽

Longest Common Subsequences

Download Full-text

An approach to solving the longest common subsequences based on string-coding functional and neural network

[Proceedings 1992] IEEE International Conference on Systems Engineering ◽

10.1109/icsyse.1992.236964 ◽

2003 ◽

Cited By ~ 1

Author(s):

Dian-Xun Shuai

Keyword(s):

Neural Network ◽

Longest Common Subsequences

Download Full-text

Some limit results for longest common subsequences

Discrete Mathematics ◽

10.1016/0012-365x(79)90057-8 ◽

1979 ◽

Vol 26 (1) ◽

pp. 17-31 ◽

Cited By ~ 30

Author(s):

Joseph G. Deken

Keyword(s):

Longest Common Subsequences

Download Full-text

Improved bounds on the average length of longest common subsequences

Journal of the ACM ◽

10.1145/1516512.1516519 ◽

2009 ◽

Vol 56 (3) ◽

pp. 1-38 ◽

Cited By ~ 9

Author(s):

George S. Lueker

Keyword(s):

Average Length ◽

Longest Common Subsequences

Download Full-text

On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words

High Dimensional Probability VII - Progress in Probability ◽

10.1007/978-3-319-40519-3_5 ◽

2016 ◽

pp. 105-136 ◽

Cited By ~ 3

Author(s):

Christian Houdré ◽

Jinyong Ma

Keyword(s):

Central Moments ◽

Longest Common Subsequences

Download Full-text

On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences

2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611972986.1 ◽

2008 ◽

Author(s):

George S. Lueker

Keyword(s):

Upper Bound ◽

Average Length ◽

Longest Common Subsequences

Download Full-text

A Dominant Point-Based Algorithm for Finding Multiple Longest Common Subsequences in Comparative Genomics

Emerging Research in Computing, Information, Communication and Applications - Advances in Intelligent Systems and Computing ◽

10.1007/978-981-13-5953-8_25 ◽

2019 ◽

pp. 289-300

Author(s):

Manish M. Motghare ◽

Preeti S. Voditel

Keyword(s):

Comparative Genomics ◽

Longest Common Subsequences ◽

Dominant Point

Download Full-text