Sciweavers

1986 search results - page 382 / 398
» Path Separability of Graphs
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
BMCBI
2006
202views more  BMCBI 2006»
13 years 7 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
BMCBI
2006
101views more  BMCBI 2006»
13 years 7 months ago
Hierarchical modularity of nested bow-ties in metabolic networks
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
Jing Zhao, Hong Yu, Jianhua Luo, Zhi-Wei Cao, Yi-X...
BMCBI
2005
84views more  BMCBI 2005»
13 years 7 months ago
A method of precise mRNA/DNA homology-based gene structure prediction
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
Alexander G. Churbanov, Mark Pauley, Daniel Quest,...
ACTAC
1998
71views more  ACTAC 1998»
13 years 7 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene