Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: common superstring problem

Sortuj według:

Ogranicz wyniki do:

Two approaches to the common superstring problem

Kasprzak M.

Foundations of Computing and Decision Sciences

2003

Vol. 28, No. 2

113-123

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.