Login / Signup
A probabilistic version of Sankoff's maximum parsimony algorithm.
Gábor Balogh
Stephan H. Bernhart
Peter F. Stadler
Jana Schor
Published in:
J. Bioinform. Comput. Biol. (2020)
Keyphrases
</>
optimal solution
probabilistic model
k means
cost function
dynamic programming
computational complexity
segmentation algorithm
neural network
learning algorithm
objective function
particle swarm optimization
machine learning
search space
np hard
information extraction
maximum likelihood