Open AccessThe Use of Maximum Edge Weight Clique and Markov Random Field Problem Formulation to Discover Motifs
Author(s) -
Alexandra Kravchuk
Publication year - 2021
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.22215/etd/2021-14583
Subject(s) - markov random field , maximum a posteriori estimation , inference , markov chain , belief propagation , mathematics , integer programming , motif (music) , random graph , graph , algorithm , computer science , combinatorics , artificial intelligence , segmentation , maximum likelihood , image segmentation , decoding methods , statistics , physics , acoustics