147 search results - page 7 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
71
Voted
SPIRE
2007
Springer
15 years 3 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
77
Voted
IPL
2007
14 years 9 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...
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
82
Voted
GD
2006
Springer
15 years 1 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...