Sciweavers

217 search results - page 36 / 44
» Constructing Incremental Sequences in Graphs
Sort
View
BMCBI
2007
162views more  BMCBI 2007»
13 years 8 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
14 years 1 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 1 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
ISPAN
2002
IEEE
14 years 1 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu