Search for dissertations about: "maximum agreement subtree"

Found 2 swedish dissertations containing the words maximum agreement subtree.

  1. 1. Consensus Algorithms for Trees and Strings

    University dissertation from Computer Science, Lund University

    Author : Jesper Jansson; Lunds universitet.; Lund University.; [2003]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; computational complexity; Approximation algorithm; labeled tree; lowest common ancestor constraint; maximum agreement subtree; alignment between trees; clustering; Computer science; Hamming metric; systems; control; Datalogi; numerisk analys; system; kontroll;

    Abstract : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. READ MORE

  2. 2. Exact and approximation algorithms for graph problems with some biological applications

    University dissertation from Computer Science, Lund University

    Author : Eva-Marta Lundell; Lunds universitet.; Lund University.; [2009]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Abstract : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. READ MORE