2 search results - page 1 / 1 » On the longest increasing subsequence of a circular list |
IPL
2007
13 years 5 months ago
2007
The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
BMCBI
2004
13 years 5 months ago
2004
Background: An increasing number of microbial genomes are being sequenced and deposited in public databases. In addition, several closely related strains are also being sequenced ...