Advanced search
Found 1 swedish dissertation matching the above criteria.
-
1. Consensus Algorithms for Trees and Strings
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
Result pages:
1