Titlebook: String Processing and Information Retrieval; 21st International S Edleno Moura,Maxime Crochemore Conference proceedings 2014 The Editor(s)

欢乐东方

垫子

Sequence Decision Diagramsent set operations. We define . (SeqDDs), which can encode arbitrary finite sets of strings over an alphabet. SeqDDs can be seen as a variant of classic decision diagrams such as BDDs and MDDs where, instead of a fixed number of levels, we simply require that the number of paths and the lengths of t

容易懂得

Shortest Unique Queries on Strings of ., a . returns a shortest unique substring of . that contains .. We present an optimal structure that consumes .(.) space, can be built in .(.) time, and answers a query in .(1) time. We also extend our techniques to solve several variants of the problem optimally.

联邦

Online Multiple Palindrome Pattern Matchingcenter they have the same length of the maximal palindrome. Given a text . of length . and a set of patterns ..,…,.., we study the online multiple palindrome pattern matching problem that finds all pairs of an index . and a pattern .. such that .[.−|..| + 1:.] and .. are pal-equivalent. We solve the

正式通知

Indexed Matching Statistics and Shortest Unique Substringsing ., are the cornerstone of a number of large-scale genome analysis applications, and they encode nontrivial structural properties of . and .. In this paper we compute for the first time the matching statistics between . and . in .((|.| + |.|)log|Σ|) time and in .(|.|log|Σ|) bits of space, circumv

Mawkish

展览

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/879717.jpg

可互换

https://doi.org/10.1007/978-3-319-11918-2algorithm; approximation algorithm; bioinformatics; compression; experimental evaluation; gene prediction

无能力

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Stringsncoded texts. We refute a former conjecture and show an algorithm for general sized alphabets. We also consider ., the extension of borders to jumbled strings. Borders are the basis for various algorithms. Finally, we consider ., strings which are of the form ., where . is a jumbling of .. We show efficient algorithms for these problems.

细菌等