All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

P3S: Protein Structure Similarity Search

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    P3S: Protein Structure Similarity Search

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F11%2F0968" target="_blank" >GAP202/11/0968: Large-scale Nonmetric Similarity Search in Complex Domains</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Euro-Par 2012: Parallel Processing Workshops

  • ISBN

    978-3-642-36948-3

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    228-237

  • Publisher name

    Springer Berlin Heidelberg

  • Place of publication

    Neuveden

  • Event location

    Rhodes Islands, Greece

  • Event date

    Aug 27, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article