PSIST: a scalable approach to indexing protein structures using suffix trees

DOI10.1016/j.jpdc.2007.07.008zbMath1243.68166OpenAlexW2092149906MaRDI QIDQ436643

J. Herrera, H. S. Yoon

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

zbMATH Keywords

bioinformaticsexternal suffix treesprotein structure indexing

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20)

Related Items

Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors, PSIST: a scalable approach to indexing protein structures using suffix trees

Uses Software

• MultiProt
• SSAP
• MUMMER
• PSI-BLAST
• BLAST

Cites Work

• Unnamed Item
• PSIST: a scalable approach to indexing protein structures using suffix trees
• Database indexing for large DNA and protein sequence collections
• On-line construction of suffix trees
• Distributed suffix trees
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• On the sorting-complexity of suffix tree construction