Sciweavers

1016 search results - page 127 / 204
» Generalized distances between rankings
Sort
View
JCB
2008
144views more  JCB 2008»
15 years 1 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 1 months ago
Intrinsic dimension of a dataset: what properties does one expect?
— We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postul...
Vladimir Pestov
JDA
2007
83views more  JDA 2007»
15 years 1 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
JMIV
2007
119views more  JMIV 2007»
15 years 1 months ago
On the Discrete Maximum Principle for the Beltrami Color Flow
We analyze the discrete maximum principle for the Beltrami color flow. The Beltrami flow can display linear as well as nonlinear behavior according to the values of a parameter ...
Lorina Dascal, Adi Ditkowski, Nir A. Sochen
JUCS
2007
84views more  JUCS 2007»
15 years 1 months ago
Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
: A method for determining consensus of hierarchical incomplete ordered partitions and coverings of sets is presented in this chapter. Incomplete ordered partitions and coverings a...
Marcin Hernes, Ngoc Thanh Nguyen