Sciweavers

892 search results - page 70 / 179
» et 2007
Sort
View
WG
2007
Springer
14 years 3 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder
ANOR
2005
160views more  ANOR 2005»
13 years 8 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
RECOMB
2007
Springer
14 years 9 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
BMCBI
2007
156views more  BMCBI 2007»
13 years 9 months ago
Bio: : NEXUS: a Perl API for the NEXUS format for comparative biological data
Background: Evolutionary analysis provides a formal framework for comparative analysis of genomic and other data. In evolutionary analysis, observed data are treated as the termin...
Thomas Hladish, Vivek Gopalan, Chengzhi Liang, Wei...
HICSS
2007
IEEE
118views Biometrics» more  HICSS 2007»
14 years 3 months ago
Introducing Executable Product Models for the Service Industry
In these days, companies need highly flexible processes to deal with changing environments and competitors. Using traditional process models that have to be modeled in all detail...
Markus Kress, Joachim Melcher, Detlef Seese