About: New path planning method for computation of constrained dynamic channels in proteins     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
  • Collision-free paths in the geometric model of a protein molecule reveal various dependencies between the structure of the molecule and its function. The paths which connect a biochemically important part of the protein molecule with the surface of the molecule can serve as egression or access paths for small molecules which react in the active site. The geometric method introduced in this paper is designed to compute such paths in the dynamic models of protein molecules. The paths have to satisfy additional constraints such as valid flow of time which allows us to distinguish between access and egression paths, minimum width and others. Possibly, the method may be used not only for protein molecules but also for similar environments with high density of spherical obstacles. The method was tested on real protein data and the results indicate that if there is a path present, it is detected by our method.
  • Collision-free paths in the geometric model of a protein molecule reveal various dependencies between the structure of the molecule and its function. The paths which connect a biochemically important part of the protein molecule with the surface of the molecule can serve as egression or access paths for small molecules which react in the active site. The geometric method introduced in this paper is designed to compute such paths in the dynamic models of protein molecules. The paths have to satisfy additional constraints such as valid flow of time which allows us to distinguish between access and egression paths, minimum width and others. Possibly, the method may be used not only for protein molecules but also for similar environments with high density of spherical obstacles. The method was tested on real protein data and the results indicate that if there is a path present, it is detected by our method. (en)
Title
  • New path planning method for computation of constrained dynamic channels in proteins
  • New path planning method for computation of constrained dynamic channels in proteins (en)
skos:prefLabel
  • New path planning method for computation of constrained dynamic channels in proteins
  • New path planning method for computation of constrained dynamic channels in proteins (en)
skos:notation
  • RIV/00216224:14330/11:00051905!RIV12-MSM-14330___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LC06008)
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
  • 215851
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/11:00051905
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • protein; path planning; collision-free path; constrained dynamic channel (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [20C018566D9A]
http://linked.open...v/mistoKonaniAkce
  • Plzeň
http://linked.open...i/riv/mistoVydani
  • Plzeň
http://linked.open...i/riv/nazevZdroje
  • WSCG Full papers proceedings
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Beneš, Petr
  • Sochor, Jiří
  • Strnad, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Union Agency
https://schema.org/isbn
  • 978-80-86943-83-1
http://localhost/t...ganizacniJednotka
  • 14330
is http://linked.open...avai/riv/vysledek of
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software