On the Optimality of Some Set Algorithms
Journal of the ACM (JACM)
The String-to-String Correction Problem
Journal of the ACM (JACM)
A system for typesetting mathematics
Communications of the ACM
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STRING-MATCHING AND OTHER PRODUCTS
STRING-MATCHING AND OTHER PRODUCTS
Selected combinatorial research problems.
Selected combinatorial research problems.
Longest common subsequences of two random sequences.
Longest common subsequences of two random sequences.
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Optimal Correspondence of String Subsequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Synchronization Problems Solvable by Generalized PV Systems
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A technique for isolating differences between files
Communications of the ACM
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Characteristic Sets of Strings Common to Semi-structured Documents
DS '99 Proceedings of the Second International Conference on Discovery Science
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
DS '01 Proceedings of the 4th International Conference on Discovery Science
MAP: A tool for understanding software
ICSE '82 Proceedings of the 6th international conference on Software engineering
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
New Processor Array Architectures for the Longest Common Subsequence Problem
The Journal of Supercomputing
A survey on tree edit distance and related problems
Theoretical Computer Science
A parallel LCS algorithm for biosequences alignment
Proceedings of the 2nd international conference on Scalable information systems
S2S: structural-to-syntactic matching similar documents
Knowledge and Information Systems
A Hybrid Approach for XML Similarity
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Constrained LCS: Hardness and Approximation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
Dependability Improvement for PPM Compressed Data by Using Compression Pattern Matching
IEICE - Transactions on Information and Systems
Communication-Efficient Private Protocols for Longest Common Subsequence
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
LCS Approximation via Embedding into Local Non-repetitive Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Structural similarity evaluation between XML documents and DTDs
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
A fine-grained XML structural comparison approach
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Applying SIMD approach to whole genome comparison on commodity hardware
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Cache-Oblivious Dynamic Programming for Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms and theory of computation handbook
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
LCS approximation via embedding into locally non-repetitive strings
Information and Computation
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization
Fast sequence similarity computing with LCS on LARPBS
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Secure outsourcing of sequence comparisons
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Web Semantics: Science, Services and Agents on the World Wide Web
Fast parallel algorithms for the longest common subsequence problem using an optical bus
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Quadratic-time algorithm for a string constrained LCS problem
Information Processing Letters
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Survey: An overview on XML similarity: Background, current trends and future directions
Computer Science Review
Hi-index | 0.02 |
The problem of finding a longest common subsequence of two strings is discussed. This problem arises in data processing applications such as comparing two files and in genetic applications such as studying molecular evolution. The difficulty of computing a longest common subsequence of two strings is examined using the decision tree model of computation, in which vertices represent “equal - unequal” comparisons. It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings. A general lower bound as a function of the ratio of alphabet size to string length is derived. The case where comparisons between symbols of the same string are forbidden is also considered and it is shown that this problem is of linear complexity for a two-symbol alphabet and quadratic for an alphabet of three or more symbols.