BYŠKA, Jan, Ivana KOLINGEROVÁ, Barbora KOZLÍKOVÁ and Jiří SOCHOR. Path-planning algorithm for transportation of molecules through protein tunnel bottlenecks. In Joaquim Jorge, Luis Paulo Santos, Roman Ďurikovič. 31st Proceedings of Spring Conference on Computer Graphics. Bratislava, Slovakia: ACM, 2015, p. 81-88. ISBN 978-1-4503-3693-2. Available from: https://dx.doi.org/10.1145/2788539.2788550.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Path-planning algorithm for transportation of molecules through protein tunnel bottlenecks
Authors BYŠKA, Jan (203 Czech Republic, belonging to the institution), Ivana KOLINGEROVÁ (203 Czech Republic), Barbora KOZLÍKOVÁ (203 Czech Republic, belonging to the institution) and Jiří SOCHOR (203 Czech Republic, guarantor, belonging to the institution).
Edition Bratislava, Slovakia, 31st Proceedings of Spring Conference on Computer Graphics, p. 81-88, 8 pp. 2015.
Publisher ACM
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Slovakia
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/15:00080779
Organization unit Faculty of Informatics
ISBN 978-1-4503-3693-2
Doi http://dx.doi.org/10.1145/2788539.2788550
UT WoS 000380609300011
Keywords in English Path planning;protein;tunnel;approximation
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 1/4/2021 12:09.
Abstract
We present a simple and fast path planning algorithm for transportation of a set of tightly connected sphere objects (a small molecule) through a narrow gap. In our approach we are using common sampling-based path planning, however, instead of sampling the entire configuration space, we estimate which subsets of this space must be crossed on the desired path. In comparison with other methods using minimal bounding volumes, we improve the algorithm accuracy for arbitrary shaped molecules and significantly reduce the number of generated samples as well as time cost of path planning. We have accomplished a number of tests on scenes formed by proteins and ligand molecules. The results suggest that the proposed method works well in practice and the number of generated samples is substantially lower then the proved upper bound.
Links
GAP202/10/1435, research and development projectName: Analýza a vizualizace proteinových struktur
Investor: Czech Science Foundation, Analysis and Visualization of Protein Structures
LC06008, research and development projectName: Centrum počítačové grafiky (Acronym: CPG)
Investor: Ministry of Education, Youth and Sports of the CR, Center of Computer Graphics
MUNI/A/1206/2014, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
PrintDisplayed: 14/10/2024 00:51