Sciweavers

193 search results - page 10 / 39
» Exponential lower bounds for the numbers of Skolem-type sequ...
Sort
View
ICALP
2003
Springer
14 years 18 days ago
Degree Distribution of the FKP Network Model
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
Noam Berger, Béla Bollobás, Christia...
JCSS
2002
95views more  JCSS 2002»
13 years 7 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
ISTCS
1993
Springer
13 years 11 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
RECOMB
2006
Springer
14 years 7 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...