Titlebook: Combinatorial Pattern Matching; 16th Annual Symposiu Alberto Apostolico,Maxime Crochemore,Kunsoo Park Conference proceedings 2005 Springer-

PSA-velocity

犬儒主義者

CLAM

On the Longest Common Rigid Subsequence Problem,ares similarity with LCS and CSP and has an important application in motif finding in biological sequences. LCRS is proved to be . hard in this paper. An exact algorithm with quasi-polynomial average running time is also provided.

冷峻

Linear-Time Construction of Compressed Suffix Arrays Using ,(, log ,)-Bit Working Space for Large A construct the index data structures for large alphabets. Our algorithm constructs the suffix array, the CSA, and the FM-index using .(.) time and .-bit working space, where . = log. 2. Our algorithm takes less time and more space than Hon et al.’s algorithm. Our algorithm uses least working space among alphabet-independent linear-time algorithms.

deciduous

On the Complexity of Sparse Exon Assembly,described in [5] yields an .(. .) result for spliced alignment, regardless of filtration mode..In this paper we suggest a new algorithm which targets the case where filtering has been applied to the data, resulting in a set of .(.) candidate exon blocks. Our algorithm yields an . solution for this case.

狂熱語言

ELATE

Cheng-fan Li,Jia-xin Huang,Shao-chun Wuare centered around the origin or the terminus of replication [8,10,18]. This constraint simplifies the median problem significantly. More precisely, we show that the median problem for the reversal distance can be solved in linear time for circular bacterial genomes.

MAIM

不適當(dāng)

共同給與

Smart Grid and Internet of Thingsares similarity with LCS and CSP and has an important application in motif finding in biological sequences. LCRS is proved to be . hard in this paper. An exact algorithm with quasi-polynomial average running time is also provided.