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

中世紀(jì)

Sujata S. Govada,Hei Lau,Suhasini Kotala a one-to-one mapping .:..?→?.., such that for every .?∈?.., it holds that .′.???..?≤?., where ., ., and . denotes the set of vertices which have distance 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 cla

最小

明智的人

Congeal

初學(xué)者

On the Efficiency of the Hamming C-Centerstring Problems,a generalization is necessary for clustering. One needs to consider a partition into a number of sets, each with a distinct centerstring. In this paper we define two natural versions of the consensus problem for c centerstrings. We analyse the hardness and fixed parameter tractability of these problems and provide approximation algorithms.

懲罰

Conference proceedings 2014ne 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. The goal

相反放置

安撫

,Compressed Subsequence Matching and Packed?Tree?Coloring, that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.

洞察力

Reversal Distances for Strings with Few Blocks or Small Alphabets,of blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size?Σ. For instance, we show that . and . are NP-hard even if the input strings have only . letter.

洞穴

On Combinatorial Generation of Prefix Normal Words,with the property that, for any word . in the language, exchanging the first occurrence of 01 by 10 in . results in another word in the language. We prove that each prefix normal word is produced in .(.) amortized time, and conjecture, based on experimental evidence, that the true amortized running time is .(log(.)).