Titlebook: Combinatorial Pattern Matching; 25th Annual Symposiu Alexander S. Kulikov,Sergei O. Kuznetsov,Pavel Pev Conference proceedings 2014 Springe

使成波狀

conception

Approximate On-line Palindrome Recognition, and Applications,olving other problems on-line. In particular we consider approximate pattern matching by non-overlapping reversals. This is the problem where two strings . and . are given and the question is whether applying a sequence of non-overlapping reversals to . results in string ..

空中

From Indexing Data Structures to de Bruijn Graphs,and dBGs, and exhibit linear time algorithms for constructing the full or contracted dBGs. Finally, we provide hints explaining why this bridge between indexes and dBGs enables to dynamically update the order . of the graph.

破布

0302-9743 sia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees; regular expressions; graphs; point sets; and arrays

Tonometry

https://doi.org/10.1007/978-3-662-62153-0ere are . distinct colors. We then restrict our attention to the case in which there are only two distinct colors. We give an index that uses . bits and . query time to detect whether there exists a matching rectangle. Finally, we give a .-space index that returns a matching rectangle, if one exists, in . time.

Jocose

危機(jī)

https://doi.org/10.1007/978-981-16-2019-5d this algorithm to compute smallest maximal palindromic factorizations of all prefixes of ., consisting only of maximal palindromes (non-extensible palindromic substring) of each prefix, in .(. log.) time and .(.) space, in an on-line manner. We also present an on-line .(.)-time .(.)-space algorithm to compute a smallest palindromic cover of ..

是突襲

Sujata S. Govada,Hei Lau,Suhasini Kotalaance at most?. to . in a graph .. We call this problem . (CPM). In the paper we study CPM with input graphs being trees and present a dichotomy of classical complexity with respect to different values of . and .. CPM on trees can be solved in polynomial time only if .?≤?2 and?.?≤?1.

Commonwealth

我悲傷