1215 search results - page 174 / 243 » Combinatorics |
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
CPM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...