PSIST: a scalable approach to indexing protein structures using suffix trees
From MaRDI portal
Publication:436643
DOI10.1016/J.JPDC.2007.07.008zbMATH Open1243.68166OpenAlexW2092149906MaRDI QIDQ436643FDOQ436643
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.07.008
Recommendations
- Geometric suffix tree: indexing protein 3-D structures
- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
- Database indexing for large DNA and protein sequence collections
- SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees
- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors
Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- Database indexing for large DNA and protein sequence collections
- On the sorting-complexity of suffix tree construction
- Distributed suffix trees
- PSIST: a scalable approach to indexing protein structures using suffix trees
Cited In (4)
- SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees
- PSIST: a scalable approach to indexing protein structures using suffix trees
- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors
- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Uses Software
This page was built for publication: PSIST: a scalable approach to indexing protein structures using suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436643)
