Sciweavers

220 search results - page 10 / 44
» Reconstruction Algorithm for Permutation Graphs
Sort
View
WABI
2004
Springer
14 years 27 days ago
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reco...
Anne Bergeron, Mathieu Blanchette, Annie Chateau, ...
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
ISPAN
1997
IEEE
13 years 11 months ago
On The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
Douglas W. Bass, Ivan Hal Sudborough
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 1 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...