Results 1 to 10 of about 752,176 (316)
Processing SPARQL queries with regular expressions in RDF databases. [PDF]
BMC Bioinformatics, 2011 Background As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C ...
Lee J +6 more
europepmc +4 more sources
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Jos C. M. Baeten +3 more
doaj +10 more sources
Enhancing Regular Expressions For Polish Text Processing
Computer Science, 2009 The paper presents proposition of regular expressions engine based on the modified Thompson’salgorithm dedicated to the Polish language processing.
Krzysztof Dorosz, Anna Szczerbińska
doaj +2 more sources
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower
Hermann Gruber, Markus Holzer
doaj +4 more sources
Algorithms for hidden markov models restricted to occurrences of regular expressions. [PDF]
Biology (Basel), 2013 Hidden Markov Models (HMMs) are widely used probabilistic models, particularly for annotating sequential data with an underlying hidden structure. Patterns in the annotation are often more relevant to study than the hidden structure itself. A typical HMM
Tataru P +4 more
europepmc +2 more sources
PhyloPattern: regular expressions to identify complex patterns in phylogenetic trees. [PDF]
BMC Bioinformatics, 2009 Background To effectively apply evolutionary concepts in genome-scale studies, large numbers of phylogenetic trees have to be automatically analysed, at a level approaching human expertise.
Gouret P, Thompson JD, Pontarotti P.
europepmc +2 more sources
Which Regular Expression Patterns are Hard to Match? [PDF]
, 2016 Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton ...
Backurs, Arturs, Indyk, Piotr
core +2 more sources
Incremental pattern matching for regular expressions [PDF]
, 2012 Graph pattern matching lies at the heart of any graph transformation-based system. Incremental pattern matching is one approach proposed for reducingthe overall cost of pattern matching over successive transformations by preserving the matches that stay ...
Ghamarian, Amir Hossein +2 more
core +4 more sources
WebCollectives: A light regular expression based web content extractor in Java
SoftwareX, 2023 Conventional web crawling methods typically involve a sequence of distinct steps for downloading and extracting web content. A noteworthy limitation of these conventional crawling approaches is their lack of a focus-based crawling strategy.
Hayri Volkan Agun
doaj +2 more sources
Regular Expressions with Lookahead [PDF]
Journal of Universal Computer Science, 2021 This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having ...
Martin Berglund +2 more
doaj +3 more sources