Sciweavers

Share
1421 search results - page 1 / 285
» Algorithms for subsequence combinatorics
Sort
View
CPM
2006
Springer
111views Combinatorics» more  CPM 2006»
10 years 8 months ago
Faster Algorithms for Computing Longest Common Increasing Subsequences
Gerth Stølting Brodal, Kanela Kaligosi, Iri...
TCS
2008
10 years 4 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
10 years 8 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
books