Zobrazeno 1 - 2
of 2
pro vyhledávání: '"algoritem na grafih"'
Autor:
Hajšen, Matic Oskar
Vprašanje v sintezni biologiji je, na koliko načninov se lahko v pare, ki jim pravimo dimeri, lepijo členi polipeptidnih verig tako, da ima zlepljena veriga predpisano obliko. Za primer samosestave ene verige v strukturo, opisano z grafom G, defni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3505::8e393f16bc95b15325794205b62c2872
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=121379
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=121379
Publikováno v:
Symmetry
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3e87d27b67a5a24c737da5ab739499
