Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Ivana Hutařová Vařeková"'
Autor:
Adam Midlik, Ivana Hutařová Vařeková, Jan Hutař, Aliaksei Chareshneu, Karel Berka, Radka Svobodová
Publikováno v:
Bioinformatics. 38:3648-3650
Summary Every protein family has a set of characteristic secondary structures. However, due to individual variations, a single structure is not enough to represent the whole family. OverProt can create a secondary structure consensus, showing the gen
Autor:
Jan Hutař, Radka Svobodová, Ivana Hutařová Vařeková, Eva Hladká, Adam Midlik, Vladimír Horský, Karel Berka
Publikováno v:
Bioinformatics
Summary Secondary structures provide a deep insight into the protein architecture. They can serve for comparison between individual protein family members. The most straightforward way how to deal with protein secondary structure is its visualization
Autor:
Adam, Midlik, Ivana, Hutařová Vařeková, Jan, Hutař, Taraka Ramji, Moturu, Veronika, Navrátilová, Jaroslav, Koča, Karel, Berka, Radka, Svobodová Vařeková
Publikováno v:
Methods in molecular biology (Clifton, N.J.). 1958
Secondary structure elements (SSEs) are inherent parts of protein structures, and their arrangement is characteristic for each protein family. Therefore, annotation of SSEs can facilitate orientation in the vast number of homologous structures which
Autor:
Jaroslav Koča, Veronika Navrátilová, Karel Berka, Jan Hutař, Taraka Ramji Moturu, Radka Svobodová Vařeková, Adam Midlik, Ivana Hutařová Vařeková
Publikováno v:
Methods in Molecular Biology ISBN: 9781493991600
Secondary structure elements (SSEs) are inherent parts of protein structures, and their arrangement is characteristic for each protein family. Therefore, annotation of SSEs can facilitate orientation in the vast number of homologous structures which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e4c85cae602fc3628dfd3e7e4d4a0c6
https://doi.org/10.1007/978-1-4939-9161-7_3
https://doi.org/10.1007/978-1-4939-9161-7_3
Publikováno v:
Automata, Languages and Programming ISBN: 9783642220111
ICALP (2)
ICALP (2)
We study the runtime in probabilistic programs with unbounded recursion. As underlying formal model for such programs we use probabilistic pushdown automata (pPDA) which exactly correspond to recursive Markov chains. We show that every pPDA can be tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7e8dc31518b23ab5bce87b22fe33774
https://doi.org/10.1007/978-3-642-22012-8_25
https://doi.org/10.1007/978-3-642-22012-8_25
Publikováno v:
ResearcherID
We study the runtime in probabilistic programs with unbounded recursion. As underlying formal model for such programs we use probabilistic pushdown automata (pPDAs) which exactly correspond to recursive Markov chains. We show that every pPDA can be t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b27d36891fb727ec9ad69fb619960d90
http://arxiv.org/abs/1007.1710
http://arxiv.org/abs/1007.1710