Ole Torp Lassen, M.Sc.
phd-fellow
Programming, Logic and Intelligent Systems Group
Computer Science
PLIS, CBIT, Roskilde University
Building 43.2 (10)
P.O. Box 260
DK-4000 Roskilde, Denmark

Phone: +45 4674 3923

Teaching

  • (spring 2010) Project-Supervisor, (the basic studies in Natural Sciences at Roskilde University)
  • (spring 2009) Project-Supervisor, (the international program for basic studies in Natural Sciences at Roskilde University)
  • (spring 2009) Teaching assistant on course DAT-C (IGA), Introduction to Graphics and Animation.

Research

Projects

  • PhD project: Biosequence Analysis in PRISM. My PhD project is supervised by Henning Christiansen. It falls within the larger LoSt project and concerns itself with the ongoing conduct and documentation of a series of explorative experiments with stochastic logic models and problems formulated in the PRISM programming language. The PRISM system is basically BProlog extended with probabilistic variables and builtin tools for probabilistic learning and reasoning. In close collaboration with experts from molecular biology and bioinformatics (Ole Skovgaard and Søren Mørk), I plan to contribute to the overall goal of the LoSt project by designing and documenting experiments with the PRISM system and relevant bio informatical problems of discovering, recognizing and predicting structure in biological sequence data.

Publications

Reviewed publications
Henning Christiansen, Christian Theil Have, Ole Torp Lassen and Matthieu Petit 2010. "Inference with constrained hidden Markov models in PRISM", Theory and Practice of Logic Programming (TPLP), 10, 4-6, 2010, 449-464, and International Conference of Logic Programming 2010 (ICLP'10).

Henning Christiansen, Christian Theil Have, Ole Torp Lassen and Matthieu Petit 2009. "A Constraint Model for Constrained Hidden Markov Model - a first Biological Application" WCB09, Workshop on Constraint Based Methods for Bioinformatics, Associated to CP 2009.Lisbon, Portugal, September 20, 2009.

H.Cristiansen and Lassen, Ole Torp, 2009. "Preprocessing for optimization of probabilistic-logic models for sequence analysis", ICLP'09, International Conference of Logic Programming 2009.

Lassen, Ole Torp, 2008. "Biosequence Analysis in PRISM." Proceedings of ICLP'08, International Conference of Logic Programming 2008.

H.Cristiansen and Lassen, Ole Torp, 2008. "Optimization and evaluation of probabilistic-logic sequence models." Proceedings of the StReBio’08 workshop - part of the ECML PKDD 2008 conference.

Unpublished papers and reports
Lassen, Ole Torp, 2006. "Skimming in comparison". Technical report, DIKU, University of Copenhagen, 2006.

Lassen, Ole Torp, 2006. "Skimming for paragraphs". Technical report, DIKU, University of Copenhagen, 2006.

Lassen, Ole Torp, 2005. "Skimming for context". Master’s thesis, DIKU, University of Copenhagen, 2005.

Attended Conferences and Workshops

  • (July 2009) The International Conference for Logic Programming 2009 (ICLP’09) in Pasadena, Califonia, USA.
  • (December 2008) Doctoral Consortium of The International Conference for Logic Programming 2008 (ICLP’08 DC) in Udine, Italy
  • (September 2008) Workshop for Statistical and Relational Learning in Bioinformatics (StReBio ’08) in Antwerben, Begium.
  • (September 2008) European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2008) in Antwerben, Belgium.

Courses and Summer Schools

Activities in the Research Community

  • FQAS 2009 - external referee.
  • PhD-board Member for CBIT (2008-), vice chair (2009-)
  • RTC-Member of the FIRST PhD School's Research Training Commity (2008-2009). FIRST stands for Foundations for Innovative Research-based Software Technologies, and the research school is a concerted effort of both academia and industry to coordinate and expand a broad series of PhD-training activities within theoretical computer science and fundamental software technologies in the Copenhagen area.

Other Fun stuff

  • Learn about Geocaching - the sport where You are the search engine.