473 search results - page 8 / 95 » Heapable Sequences and Subsequences |
ENDM
2008
14 years 10 months ago
2008
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
APBC
2004
14 years 11 months ago
2004
Protein structure prediction is considered to be the holy grail of bioinformatics. Ab initio and homology modelling are two important groups of methods used in protein structure p...
144
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
CONCUR
2008
Springer
14 years 12 months ago
2008
Springer
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
133
click to vote
TCS
2008
14 years 10 months ago
2008
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...