152 search results - page 8 / 31 » Sorting by reversals is difficult |
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Revealing and being able to manipulate the structured content of PDF documents is a difficult task, requiring pre-processing and reverse engineering techniques. In this paper, we ...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Maintaining a legacy database is a difficult task especially when system documentation is poor written or even missing. Database reverse engineering is an attempt to recover high-...
BMCBI
2007
13 years 7 months ago
2007
Computational analysis of eukaryotic promoters is one of the most difficult problems in computational genomics and is essential for understanding gene expression profiles and reve...
COMBINATORICS
2007
13 years 7 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...