Suffix trees are highly regarded data structures for text indexing and string algorithms
[MCreight 76, Weiner 73]. For any given string w of length n=| w|, a suffix tree for w takes O …

The longest common subsequence of a given set of strings is a string whose characters are
common among all of them with two properties of being ordered but not consecutive. The …

This paper addresses the task of extracting free-text sections from scientific PDF documents,
and specifically the problem of formatting disparity among different publications, by …

Subjective pattern comparison has been subject to increased scrutiny by the courts and by
the general public, resulting in an increased interest in pattern comparison algorithms that …

The Longest Common Substring of two strings is a character sequence that appears in both
texts and is the longest of these. The method is widely used in several text similarity …

Let∑ be an alphabet. For two strings X, Y, and a constrained string P over the alphabet∑,
the constrained longest common substring problem for two strings X and Y with respect to P …

Tato práce pojednává o struktuře suřixových stromů, jejich implementaci a problematice,
kterou pomocí suřixových stromů řešíme. Práce se také zaměřuje na konstrukci sufixového …

The SUS problem and the first generalization can be solved in linear time and space with
the help of the suffix array and the LCP-array of S; see eg [6]. The last problem was solved …

論文抄録 プログラムの処理の類似性はコンピュータセキュリティやプログラム解析の分野における
重要な指標であり, 既知の脆弱性を持つコードと同様の処理が行われている箇所の検出や …