Sciweavers

906 search results - page 7 / 182
» Matching Subsequences in Trees
Sort
View
BMCBI
2005
138views more  BMCBI 2005»
13 years 7 months ago
Detailed protein sequence alignment based on Spectral Similarity Score (SSS)
Background: The chemical property and biological function of a protein is a direct consequence of its primary structure. Several algorithms have been developed which determine ali...
Kshitiz Gupta, Dina Thomas, S. V. Vidya, K. V. Ven...
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 7 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
APBC
2004
125views Bioinformatics» more  APBC 2004»
13 years 9 months ago
A Dihedral Angle Database of Short Sub-sequences for Protein Structure Prediction
Protein structure prediction is considered to be the holy grail of bioinformatics. Ab initio and homology modelling are two important groups of methods used in protein structure p...
Saravanan Dayalan, Savitri Bevinakoppa, Heiko Schr...
TCS
2008
13 years 7 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 1 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland