14 search results - page 2 / 3 » Two Algorithms for LCS Consecutive Suffix Alignment |
IPL
2008
13 years 5 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
JCSS
2002
13 years 5 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
APBC
2004
13 years 7 months ago
2004
Following advances in biotechnology, many new whole genome sequences are becoming available every year. A lot of useful information can be derived from the alignment and compariso...
RECOMB
1998
Springer
13 years 10 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
CLEF
2010
Springer
13 years 6 months ago
2010
Springer
We present our hybrid system for the PAN challenge at CLEF 2010. Our system performs plagiarism detection for translated and non-translated externally as well as intrinsically plag...