Sciweavers

Share
26 search results - page 1 / 6
» How to Achieve an Equivalent Simple Permutation in Linear Ti...
Sort
View
RECOMB
2007
Springer
10 years 6 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
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
9 years 11 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
9 years 11 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
9 years 20 days ago
Achieving higher frequencies in large-scale nonlinear model predictive control
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
Victor M. Zavala, Mihai Anitescu
EOR
2011
140views more  EOR 2011»
9 years 19 days ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus
books