Deafness mutation mining using regular expression based pattern matching
<p>Abstract</p> <p>Background</p> <p>While keyword based queries of databases such as Pubmed are frequently of great utility, the ability to use regular expressions in place of a keyword can often improve the results output by such databases. Regular expressions can all...
Main Author: | Frenz Christopher M |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2007-10-01
|
Series: | BMC Medical Informatics and Decision Making |
Online Access: | http://www.biomedcentral.com/1472-6947/7/32 |
Similar Items
-
Which Regular Expression Patterns Are Hard to Match?
by: Backurs, Arturs, et al.
Published: (2017) -
Pattern Matching for Regular Expression in Network Security
by: 吳柏庚
Published: (2007) -
Deaf children in regular classroom
by: NOELIA RUIZ VALLEJOS
Published: (2015-11-01) -
Two-Phase Pattern Matching for Regular Expressions in Intrusion Detection Systems
by: Chang-Ching Yang, et al.
Published: (2008) -
PERG-Rx : an FPGA-based pattern-matching engine with limited regular expression support for large pattern databases
by: Ho, Johnny Tsung Lin
Published: (2009)