M. Kasprzak,
"Two approaches to the common superstring problem",
Foundations of Computing and Decision Sciences 28,
2003, pp. 113-123.
Abstract:
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.
Back to the List of publications
21 Oct 2003