Sökning: "maximum agreement subtree"
Hittade 2 avhandlingar innehållade orden maximum agreement subtree.
1. Consensus Algorithms for Trees and Strings
Sammanfattning : 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. LÄS MER
2. Exact and approximation algorithms for graph problems with some biological applications
Sammanfattning : 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. LÄS MER