ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
IWANN
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...