Results 91 to 100 of about 7,287,958 (273)

Combining globally search for a regular expression and print matching lines with bibliographic monitoring of genomic database improves diagnosis. [PDF]

Front Genet, 2023
Tran Mau-Them F, Overs A, Bruel AL, Duquet R, Thareau M, Denommé-Pichon AS, Vitobello A, Sorlin A, Safraou H, Nambot S, Delanne J, Moutton S, Racine C, Engel C, De Giraud d'Agay M, Lehalle D, Goldenberg A, Willems M, Coubes C, Genevieve D, Verloes A, Capri Y, Perrin L, Jacquemont ML, Lambert L, Lacaze E, Thevenon J, Hana N, Van-Gils J, Dubucs C, Bizaoui V, Gerard-Blanluet M, Lespinasse J, Mercier S, Guerrot AM, Maystadt I, Tisserant E, Faivre L, Philippe C, Duffourd Y, Thauvin-Robinet C.   +40 more
europepmc   +1 more source

Low-power TCAM for regular expression matching

Tongxin xuebao, 2014
A character-indexed regular expression matching algorithm was presented to address the limitations of TCAM power consumption. This algorithm used the idea of separating the alphabet table from the states in deterministic finite automaton (DFA) for ...
Lin-xuan DING, Kun HUANG, Da-fang ZHANG
doaj   +2 more sources

Understanding Regular Expressions

Programming Historian, 2013
In this lesson, we will use advanced find-and-replace capabilities in a word processing application in order to make use of structure in a brief historical document that is essentially a table in the form of prose.
openaire   +3 more sources

Offset-FA: A Uniform Method to Handle Both Unbounded and Bounded Repetitions in Regular Expression Matching. [PDF]

Sensors (Basel), 2022
Xu C, Yu K, Xu X, Bao X, Wu S, Zhao B.
europepmc   +1 more source

Novel NFA engine construction method of regular expressions

Tongxin xuebao, 2014
A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed.There are three main algorithms in PFA,the pretreatment algorithm,the coding parser tree algorithm and the NFA ...
Mao-hua JING, Yi-xian YANG, Tao WANG, Yang XIN   +3 more
doaj  

Improved space protocol identification algorithm

Tongxin xuebao, 2012
An improved boyer-moore (BM) algorithm for space protocol identification was proposed.First,a space data preprocessing technique based on bit distance was used to increase the size of data set.A decimal jumping technique was introduced to enhance the ...
Tian-ming ZHENG, Tao WANG, Shi-ze GUO, Hua LI, Xin-jie ZHAO   +4 more
doaj  

Optimization and Security Analysis of Interconnected Security Control Based on Semantic of Process Communication

天地一体化信息网络, 2021
Facing the demand of multi-domain security control in the integrated network of air and ground, to solve the problem that singleprocess regular matching restricts the performance of interconnected security gateway, the method of high-performance ...
Bo LU, Yueming LU
doaj   +2 more sources

NUWT: JAWI-SPECIFIC BUCKWALTER CORPUS FOR MALAY WORD TOKENIZATION

Journal of ICT, 2016
This paper describes the design and creation of a monolingual parallel corpus for the Malay language written in Jawi. This paper proposes a new corpus called the National University of Malaysia Word Tokenization (NUWT) corpora To the best of our ...
Juhaida Abu Bakar, Khairuddin Omar, Mohammad Faidzul Nasrudin, Mohd Zamri Murah   +3 more
doaj  

Programming Techniques: Regular expression search algorithm [PDF]

, 1968
Thompson Ken
openalex   +1 more source

Regular expressions into finite automata

Theoretical Computer Science, 1993
It is well-known that the regular expressions can be translated into non- deterministic finite automata \((NFA)\) with or without \(\lambda\)- transitions. The standard method first translate a regular expression, in linear time, into an NFA with \(\lambda\)-transitions and then the \(\lambda\)-transitions are eliminated in quadratic time.
openaire   +3 more sources