Sciweavers

22 search results - page 5 / 5
» The Structure of Level-k Phylogenetic Networks
Sort
View
COCOON
2007
Springer
13 years 11 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
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...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
BMCBI
2006
143views more  BMCBI 2006»
13 years 4 months ago
IsoSVM - Distinguishing isoforms and paralogs on the protein level
Background: Recent progress in cDNA and EST sequencing is yielding a deluge of sequence data. Like database search results and proteome databases, this data gives rise to inferred...
Michael Spitzer, Stefan Lorkowski, Paul Cullen, Al...