Logo des Repositoriums
 

A method for fast approximate searching of polypeptide structures in the PDB

Kurzanzeige
dc.contributor.authorTäubig, Hanjo
dc.contributor.authorBuchner, Arno
dc.contributor.authorGriebsch, Jan
dc.contributor.editorGiegerich, Robert
dc.contributor.editorStoye, Jens
dc.date.accessioned2019-10-11T11:32:41Z
dc.date.available2019-10-11T11:32:41Z
dc.date.issued2004
dc.description.abstractThe main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalized suffix tree and relies on an translationand rotation-invariant representation of the protein backbone. The method was evaluated by applying structural queries to the PDB and comparing the results to the established tool SPASM. Our experiments show that the new method reduces the query time by orders of magnitude while producing comparable results.en
dc.identifier.isbn3-88579-382-2
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/28677
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics 2004, GCB 2004
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-53
dc.subjectprotein structure
dc.subjectdatabase index
dc.subjectdihedral angle
dc.subjectgeneralized suffix tree
dc.titleA method for fast approximate searching of polypeptide structures in the PDBen
dc.typeText/Conference Paper
gi.citation.endPage74
gi.citation.publisherPlaceBonn
gi.citation.startPage65
gi.conference.dateOctober 4-6, 2004
gi.conference.locationBielefeld
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Vorschaubild
Name:
GI-Proceedings.53-8.pdf
Größe:
153.24 KB
Format:
Adobe Portable Document Format
Herunterladen

Sammlungen

P053 - GCB 2004 - German Conference on Bioinformatics