P3S: Protein Structure Similarity Search

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10124114" target="_blank" >RIV/00216208:11320/13:10124114 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/chapter/10.1007/978-3-642-36949-0_26" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-36949-0_26</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-36949-0_26" target="_blank" >10.1007/978-3-642-36949-0_26</a>

Jazyk výsledku

angličtina

Název v původním jazyce

P3S: Protein Structure Similarity Search

Popis výsledku v původním jazyce

Similarity search in protein structure databases is an important task of computational biology. To reduce the time required to search for similar structures, indexing techniques are being often introduced. However, as the indexing phase is computationally very expensive, it becomes useful only when a large number of searches are expected (so that the expensive indexing cost is amortized by cheaper search cost). This is a typical situation for a public similarity search service. In this article we introduce the P3S web application (http://siret.cz/p3s) allowing, given a query structure, to identify the set of the most similar structures in a database. The result set can be browsed interactively, including visual inspection of the structure superposition, or it can be downloaded as a zip archive. P3S employs the SProt similarity measure and an indexing technique based on the LAESA method, both introduced recently by our group. Together with the measure and the index, the method presents

Název v anglickém jazyce

P3S: Protein Structure Similarity Search

Popis výsledku anglicky

Similarity search in protein structure databases is an important task of computational biology. To reduce the time required to search for similar structures, indexing techniques are being often introduced. However, as the indexing phase is computationally very expensive, it becomes useful only when a large number of searches are expected (so that the expensive indexing cost is amortized by cheaper search cost). This is a typical situation for a public similarity search service. In this article we introduce the P3S web application (http://siret.cz/p3s) allowing, given a query structure, to identify the set of the most similar structures in a database. The result set can be browsed interactively, including visual inspection of the structure superposition, or it can be downloaded as a zip archive. P3S employs the SProt similarity measure and an indexing technique based on the LAESA method, both introduced recently by our group. Together with the measure and the index, the method presents

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F11%2F0968" target="_blank" >GAP202/11/0968: Podobnostní nemetrické vyhledávání v rozsáhlých komplexních databázích</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Euro-Par 2012: Parallel Processing Workshops

ISBN

978-3-642-36948-3

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

10

Strana od-do

228-237

Název nakladatele

Springer Berlin Heidelberg

Místo vydání

Neuveden

Místo konání akce

Rhodes Islands, Greece

Datum konání akce

27. 8. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—