Sciweavers

148 search results - page 13 / 30
» Constructing Big Trees from Short Sequences
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
14 years 11 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
90
Voted
CP
2000
Springer
15 years 2 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
107
Voted
ISMIS
1997
Springer
15 years 3 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
91
Voted
BMCBI
2010
193views more  BMCBI 2010»
14 years 11 months ago
caGrid Workflow Toolkit: A Taverna based workflow tool for cancer Grid
Background: In biological and medical domain, the use of web services made the data and computation functionality accessible in a unified manner, which helped automate the data pi...
Wei Tan, Ravi K. Madduri, Aleksandra Nenadic, Stia...
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 4 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...