Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM- United States

doi 10.1145/321921.321922

Full Text

Abstract

Available in

Categories

Systems Engineering

Information Systems

Artificial Intelligence

Date

January 1, 1976

Authors

D. S. Hirschberg

Publisher

Association for Computing Machinery (ACM)

Related search

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research

Management Science

Computer Science

Operations Research

English

Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem

Applied Soft Computing Journal

English

A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem

Journal of Heuristics

Information Systems

Management Science

Computer Networks

Operations Research

Artificial Intelligence

English

Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Computer Networks

Molecular Physics,

Magnetic Materials

English

Acceleration of Sequence Clustering Using Longest Common Subsequence Filtering

BMC Bioinformatics

Applied Mathematics

Computer Science Applications

Structural Biology

Molecular Biology

English

Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

English

A GPU Implementation of a Bit-Parallel Algorithm for Computing the Longest Common Subsequence

IPSJ Online Transactions

English

Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English