Titlebook: String Processing and Information Retrieval; 19th International S Liliana Calderón-Benavides,Cristina González-Caro, Conference proceedings

凹處

Compressed Suffix Trees for Repetitive Texts,on large collections of genomes of the close species. We build on an existing compressed suffix tree that applies statistical compression, and modify it so that it works on the grammar-compressed version of the longest common prefix array, whose differential version inherits much of the repetitivene

顯微鏡

Configurations and Minority in the String Consensus Problem,ng distance of . from each of the strings is minimized. We denote this distance with .. The string . is called a consensus string. In this paper we present two main algorithms, the . algorithm with .(.. ? .) running time for this problem, and the . algorithm..The problem was introduced by Lanctot, L

果仁

眨眼

嚴(yán)峻考驗

鈍劍

construct

令人苦惱

Active Microbloggers: Identifying Influencers, Leaders and Discussers in Microblogging Networks,is algorithms called ., . and . that identify influencers, leaders and discussers, respectively. Conducted experiments on TREC 2011 Microblog dataset, show that the proposed algorithms outperform close microblogger ranking approaches.

phase-2-enzyme

Banister

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences,ions in the sequence. As a natural extension of the longest common subsequence problem, Evans introduced the L. A.-P. C. S. (LAPCS) problem as a framework for studying the similarity of arc-annotated sequences. This problem has been studied extensively in the literature due to its potential applicat