Sciweavers

2766 search results - page 486 / 554
» Algorithms for trigonometric polynomials
Sort
View
134
Voted
DM
1998
68views more  DM 1998»
15 years 3 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
129
Voted
JCB
1998
105views more  JCB 1998»
15 years 3 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
108
Voted
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 3 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
138
Voted
JCB
2008
111views more  JCB 2008»
15 years 3 months ago
Sorting Genomes with Centromeres by Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
Michal Ozery-Flato, Ron Shamir
113
Voted
PVLDB
2008
111views more  PVLDB 2008»
15 years 3 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu