371 search results - page 49 / 75 » Algorithms for phylogenetic footprinting |
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
PVLDB
2010
14 years 10 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
RECOMB
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
91
Voted
ICNP
2009
IEEE
15 years 6 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...