|
Trudy SPIIRAN, 2013, Issue 27, Pages 200–244
(Mi trspy656)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Minimal join graph subsets synthesis system
A. A. Filchenkovab, K. V. Frolenkovba, A. V. Sirotkinba, A. L. Tulupyevba a St. Petersburg Institute for Informatics and Automation of RAS
b St. Petersburg State University, Department of Mathematics and Mechanics
Abstract:
Two-stage scheme for minimal join graph subsets synthesis that involves the construction of three sets (stereoseparators, their possessions and necessary edges) over given subalphabet set with subsequent construction a set of a certain kind of sinews for each stereoseparator. Systematized algorithms, implementing both stages, are systematized and their complexity is estimated.
Keywords:
algebraic Bayesian network, minimal join graph, secondary structure, global learning.
Received: 02.06.2013
Citation:
A. A. Filchenkov, K. V. Frolenkov, A. V. Sirotkin, A. L. Tulupyev, “Minimal join graph subsets synthesis system”, Tr. SPIIRAN, 27 (2013), 200–244
Linking options:
https://www.mathnet.ru/eng/trspy656 https://www.mathnet.ru/eng/trspy/v27/p200
|
Statistics & downloads: |
Abstract page: | 260 | Full-text PDF : | 111 | References: | 38 | First page: | 1 |
|