L. Hammel and J. M. Patel, "Searching on the Secondary Structure of Protein Sequences," presented at VLDB'02, Hong Kong, China, 2002, pp. 634-645.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Vectorization Techniques for Protein Data Analysis: A.. - Srinivasa, Kumar (Correct)
....nodes or atoms in which consecutive nodes are linked by a bond. The length of the path is determined by a configurable parameter called path length. In the third data model, secondary structures of proteins are stored as sequences of structural motifs like helix, sheets and loops. An example is [HP02]. Rather than algorithms on structure, algorithms on sequences are used. However, searching for structural similarity at the secondary level is less accurate than at the primary level. For instance, even if two corresponding helices match among proteins, the size of the helices may be different. ....
Laurie Hammel, Jignesh M. Patel. Searching on the Secondary Structure of Protein Sequences. In Proc. Of 28 International Conference on Very Large Databases (VLDB), Hong Kong, China, 2002.
PiQA: An Algebra for Querying Protein Data Sets - Sandeep Tata And Self-citation (Patel) (Correct)
No context found.
L. Hammel and J. M. Patel, "Searching on the Secondary Structure of Protein Sequences," presented at VLDB'02, Hong Kong, China, 2002, pp. 634-645.
Searching on the Secondary Structure of Protein Sequences - Hammel, Patel (2002) (1 citation) Self-citation (Hammel Patel) (Correct)
....at some point by a loop of length 5. These three classes of queries provide an initial functionality for our system to solve; we will look at more complex queries in our future work. A more formal definition of the three query classes may be found in the full length version of this paper [12]. 4. Query Evaluation Techniques This section describes four methods for evaluating the types of queries defined above. The first approach uses a protein scan while the last three utilize a segmentation technique similar to that described in Section 3 that represents proteins as ....
....of the 4 bucket and whose protein id lies within the 3 bucket. 5.2. 2 Result Cardinality Estimation In the interest of space, we explain our cardinality estimation algorithm using an example; a more detailed explanation of the algorithm is provided in the full length version of this paper [12]. Consider the query: P 1 P 2 , which has two predicates P 1 and P 2 . Table 3 shows all possible arrangements for the two predicates in a histogram with three buckets for the start position ranges 0 49, 50 99 and 100 149, respectively. For simplicity we assume here that these three start ....
[Article contains additional citation context not shown here]
L. Hammel, J. M. Patel. Searching on the Secondary Structure of Protein Sequences. Technical Report, University of Michigan, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC