1215 search results - page 215 / 243 » Combinatorics |
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
67
Voted
CPM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...