Sciweavers

799 search results - page 137 / 160
» Function Sequence Genetic Programming
Sort
View
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
14 years 29 days ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
GCB
2008
Springer
174views Biometrics» more  GCB 2008»
13 years 10 months ago
Lightweight Comparison of RNAs based on Exact Sequence-structure Matches
: Specific functions of RNA molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence ...
Steffen Heyne, Sebastian Will, Michael Beckstette,...
DASFAA
2005
IEEE
209views Database» more  DASFAA 2005»
14 years 2 months ago
PADS: Protein Structure Alignment Using Directional Shape Signatures
A novel approach for similarity search on the protein structure databases is proposed. PADS (Protein Alignment by Directional shape Signatures) incorporates the three dimensional ...
S. Alireza Aghili, Divyakant Agrawal, Amr El Abbad...
ESANN
2004
13 years 10 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
TCS
2008
13 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman