Sciweavers

239 search results - page 32 / 48
» Searching Protein 3-D Structures in Linear Time
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 9 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
BMCBI
2006
203views more  BMCBI 2006»
13 years 7 months ago
Independent component analysis reveals new and biologically significant structures in micro array data
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...
DAM
2000
97views more  DAM 2000»
13 years 7 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos
ADAEUROPE
2003
Springer
14 years 26 days ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
BMCBI
2005
132views more  BMCBI 2005»
13 years 7 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer