Efficient and exact maximum likelihood Quantisation of genomic features using dynamic programming

Mingzhou Song, Robert M. Haralick, Stéphane Boissinot

Research output: Contribution to journalArticlepeer-review


An efficient and exact dynamic programming algorithm is introduced to quantise a continuous random variable into a discrete random variable that maximises the likelihood of the quantised probability distribution for the original continuous random variable. Quantisation is often useful before statistical analysis and modelling of large discrete network models from observations of multiple continuous random variables. The quantisation algorithm is applied to genomic features including the recombination rate distribution across the chromosomes and the non-coding transposable element LINE-1 in the human genome. The association pattern is studied between the recombination rate, obtained by quantisation at genomic locations around LINE-1 elements, and the length groups of LINE-1 elements, also obtained by quantisation on LINE-1 length. The exact and density-preserving quantisation approach provides an alternative superior to the inexact and distance-based univariate iterative k-means clustering algorithm for discretisation.

Original languageEnglish (US)
Pages (from-to)123-141
Number of pages19
JournalInternational Journal of Data Mining and Bioinformatics
Issue number2
StatePublished - Mar 2010


  • Discretisation
  • Dynamic programming
  • LINE-1
  • Quantisation
  • Recombination rate distribution
  • Retrotransposon
  • Transposable elements

ASJC Scopus subject areas

  • Information Systems
  • General Biochemistry, Genetics and Molecular Biology
  • Library and Information Sciences


Dive into the research topics of 'Efficient and exact maximum likelihood Quantisation of genomic features using dynamic programming'. Together they form a unique fingerprint.

Cite this