Results 231 to 240 of about 1,233,843 (271)
Some of the next articles are maybe not open access.
Journal of Applied Statistics, 2004
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques,
openaire +1 more source
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques,
openaire +1 more source
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2000
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amir, Amihood +4 more
openaire +2 more sources
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amir, Amihood +4 more
openaire +2 more sources
2000
Special issue of $ extit{J. Discrete Algorithms}$
Crochemore, Maxime, Gąsieniec, Leszek
openaire +1 more source
Special issue of $ extit{J. Discrete Algorithms}$
Crochemore, Maxime, Gąsieniec, Leszek
openaire +1 more source
A Survey on Distributed Graph Pattern Matching in Massive Graphs
ACM Computing Surveys, 2022Sarra Bouhenni, Saïd Yahiaoui
exaly
Qualitative research: extending the range with flexible pattern matching
Review of Managerial Science, 2021Ricarda B Bouncken +2 more
exaly
Flexible pattern matching approach: Suggestions for augmenting theory evolvement
Technological Forecasting and Social Change, 2021Ricarda B Bouncken, Yixin Qiu
exaly