Sökning: "Hamming metric Computer science clustering alignment between trees maximum agreement subtree lowest"

Hittade 1 avhandling innehållade orden Hamming metric Computer science clustering alignment between trees maximum agreement subtree lowest.

1. 1. Consensus Algorithms for Trees and Strings

   Författare :Jesper Jansson; Institutionen för datavetenskap; []
   Nyckelord :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;

   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