Contact  Publications  Research  Software  Teaching
Software

LEcount
(Linear Extension Counting)
– A program for counting the linear extensions of a given partial order
(c) 2015 K. Kangas, T. Hankala, T. Niinimäki, M. Koivisto, University of Helsinki. IJCAI'16. 
Junctor & Adjunct
(Junction Trees Optimally and Recursively)
– Programs for Bayesian learning of decomposable graphical models from complete data
(c) 2015 K. Kangas, T. Niinimäki, M. Koivisto, HIIT and University of Helsinki. NIPS'14, UAI'15. 
BOSON
(Bucker Order Scheme for Optimal Networks)
– A program for finding an optimal Bayesian network structure
(c) 2013 P. Parviainen and M. Koivisto, HIIT and University of Helsinki. UAI'09, JMLR 2013. 
BEANDisco
(Bayesian Exact and Approximate Network Discovery)
– A program for exact and approximate Bayesian structure discovery in Bayesian networks
(c) 2011 T. Niinimäki, P. Parviainen, M. Koivisto, HIIT and University of Helsinki. AISTATS'10, UAI'11. 
REBEL
(Rapid Exact Bayesian Edge Learning)
– A program for exact Bayesian structure discovery in Bayesian networks
(c) 2006 M. Koivisto and K. Sood, HIIT Basic Research Unit, University of Helsinki. JMLR 2004, UAI'06. 
HIT
(Haplotype Inference Technique)
– A program for reconstructing haplotypes from unphased genotype data
using a hidden Markov model
(c) 2005 P. Rastas, University of Helsinki. WABI'05. 
MDLBlockFinder
– A Minimum Description Length based method for the analysis
of haplotype blocks
(c) 2003 M. Koivisto, H. Mannila, M. Lukk, K. Sood, and E. Ukkonen. University of Helsinki and HIIT BRU. PSB'03.
Contact  Publications  Research  Software  Teaching
Last modified Sep 25, 2017.