The following pages link to Combinatorial Pattern Matching (Q5713543):
Displaying 10 items.
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- On multiple longest common subsequence and common motifs with gaps (extended abstract) (Q1641122) (← links)
- Finding the longest common sub-pattern in sequences of temporal intervals (Q1715886) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- The longest filled common subsequence problem (Q5110878) (← links)
- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs (Q5307512) (← links)
- (Q5390355) (← links)
