473 search results - page 3 / 95 » Heapable Sequences and Subsequences |
CAI
2010
Springer
13 years 8 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
ICDM
2007
IEEE
14 years 5 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
DASFAA
2006
IEEE
14 years 4 months ago
2006
IEEE
There is much interest in the processing of data streams for applications in the fields such as financial analysis, network monitoring, mobile services, and sensor network manage...
AAIM
2006
Springer
14 years 4 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....