Sciweavers

692 search results - page 45 / 139
» Combinatorics of Partial Derivatives
Sort
View
RECOMB
2006
Springer
14 years 11 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
NIPS
2008
14 years 6 days ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
14 years 2 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
RTCSA
1998
IEEE
14 years 3 months ago
Protocol Synthesis from Context-Free Processes Using Event Structures
In this paper, we propose a protocol synthesis method based on a partial order model (called event structures) for the class of context-free processes. First, we assign a unique n...
Akio Nakata, Teruo Higashino, Kenichi Taniguchi
COCOON
2007
Springer
14 years 5 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...