About: Improved Alignment of Protein Sequences Based on Common Parts     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • In the last twenty years, protein databases have been growing exponentially. To speed up the search, heuristic approaches have been proposed and their accuracy has been steadily growing, but exact search is still needed in some cases. The only exact search algorithm remains SSEARCH (or it’s clones) which sequentially scans database of protein sequences, and performs full alignment against each of the sequences. Due to the need of the exact search, we focus on improving the sequential search algorithm. We decrease the costs needed to compute the alignment of pair of protein sequences when used with large databases. This is achieved by reusing alignment calculations of common parts of the sequences without loss of accuracy. With this method, we reduced the computational costs by up to 20 % depending on the database size and subset used. We also implemented approximate search which further reduced computational costs for the the sake of some accuracy loss.
  • In the last twenty years, protein databases have been growing exponentially. To speed up the search, heuristic approaches have been proposed and their accuracy has been steadily growing, but exact search is still needed in some cases. The only exact search algorithm remains SSEARCH (or it’s clones) which sequentially scans database of protein sequences, and performs full alignment against each of the sequences. Due to the need of the exact search, we focus on improving the sequential search algorithm. We decrease the costs needed to compute the alignment of pair of protein sequences when used with large databases. This is achieved by reusing alignment calculations of common parts of the sequences without loss of accuracy. With this method, we reduced the computational costs by up to 20 % depending on the database size and subset used. We also implemented approximate search which further reduced computational costs for the the sake of some accuracy loss. (en)
  • Vylepšené zarovnání proteinových sekvencích založené na společných částech (cs)
Title
  • Improved Alignment of Protein Sequences Based on Common Parts
  • Improved Alignment of Protein Sequences Based on Common Parts (en)
  • Vylepšené zarovnání proteinových sekvencích založené na společných částech (cs)
skos:prefLabel
  • Improved Alignment of Protein Sequences Based on Common Parts
  • Improved Alignment of Protein Sequences Based on Common Parts (en)
  • Vylepšené zarovnání proteinových sekvencích založené na společných částech (cs)
skos:notation
  • RIV/00216208:11320/08:00101243!RIV09-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 371682
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00101243
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Improved; Alignment; Protein; Sequences; Based; Common; Parts (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [180FD2887A76]
http://linked.open...v/mistoKonaniAkce
  • Neuveden
http://linked.open...i/riv/nazevZdroje
  • ISBRA 2008: Bioinformatics Research and Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hoksza, David
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000255941000008
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-79449-3
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software