Sciweavers

48 search results - page 5 / 10
» The Minimum Number of Monotone Subsequences
Sort
View
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
14 years 26 days ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 10 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 1 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
JMM2
2008
73views more  JMM2 2008»
13 years 8 months ago
Introducing JOUNBO: A New Advanced Online Journal and Newspaper Browser
Today, digital journals and newspapers are available online by almost any publishing agency. The effect of this rapidly growing use creates an increased demand for solutions which ...
Petros Lalos, George S. Tombras
ENGL
2007
94views more  ENGL 2007»
13 years 8 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna