Sciweavers

371 search results - page 30 / 75
» Case Study: Visualizing Sets of Evolutionary Trees
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
14 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
60
Voted
JSYML
2008
72views more  JSYML 2008»
14 years 9 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
90
Voted
DEXA
2004
Springer
94views Database» more  DEXA 2004»
15 years 3 months ago
Visualization Process of Temporal Data
Abstract. Temporal data are abundantly present in many application domains such as banking, financial, clinical, geographical applications and so on. Temporal data have been extens...
Chaouki Daassi, Laurence Nigay, Marie-Christine Fa...
BMCBI
2010
142views more  BMCBI 2010»
14 years 9 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
JOIN
2007
91views more  JOIN 2007»
14 years 9 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest