Titlebook: Combinatorial Pattern Matching; 26th Annual Symposiu Ferdinando Cicalese,Ely Porat,Ugo Vaccaro Conference proceedings 2015 Springer Interna

LEVY

恫吓

Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wangic and dynamic) are suffix trees, where we also show how to pre- or append letters in . time. Our main technical contribution is a weighted variant of exponential search trees, which might be of independent interest.

飞镖

Longest Common Extensions in Sublinear Space,y time. In this paper we show that for any trade-off parameter ., the problem can be solved in . space and . query time. This significantly improves the previously best known time-space trade-offs, and almost matches the best known time-space product lower bound.

DRILL

Alphabet-Dependent String Searching with Wexponential Search Trees,ic and dynamic) are suffix trees, where we also show how to pre- or append letters in . time. Our main technical contribution is a weighted variant of exponential search trees, which might be of independent interest.

Keshan-disease

虚弱

Christian Vetter,Mariia Semenovathat such a parameterization does not admit a polynomial kernel up to some complexity assumption. We also obtain several results about “below guaranteed values” parameterization of the problem. We show that parameterization by compression admits a polynomial kernel while parameterization “below matching” is hard.

怎样才咆哮

Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wanglects the length of the strings from which the overlap digraph is constructed. We study the asymptotic behaviour of readability by casting it in purely graph theoretic terms (without any reference to strings). We prove upper and lower bounds on readability for certain graph families and general graphs.

仲裁者

Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wang is known that this problem can be solved in . time. In this paper, we first propose an .-time algorithm for the problem based on interesting properties of boxed subsequences. Then, we give a further improved algorithm which runs in . time using preprocessed information on . and order-statistics trees.

growth-factor

租约

Ranked Document Retrieval with Forbidden Pattern, obtain a linear space and . query time solution for the document listing problem, where . is the number of documents reported. We conjecture that any significant improvement over the results in this paper is highly unlikely.