Two approaches to the common superstring problem

• Autorzy: Kasprzak M.
• Języki publikacji: EN

Abstrakty

EN

In the paper, two approaches to the common superstring problem are presented. The exact, branch and bound method minimizes the length of the solution containing all input substrings. The heuristic method returns a supersting of a maximum likelihood value. Both methods can be used as bases for DNA assembly algorithms, thus computational tests were performed on instances derived from real DNA sequences in order to check their usefulness in practice.

Słowa kluczowe

EN

common superstring problem

PL

informatyka

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2003
• Tom: Vol. 28, No. 2
• Strony: 113--123
• Opis fizyczny: Bibliogr. 4 poz.

Twórcy

autor

Kasprzak M.

• Institute of Computing Science, Poznań University of Technology, Piotrowo 3A, 60-965 Poznań, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12, 61-704 Poznań, Poland,