PMC:1679804 / 21799-22364 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/PMC/sourceid/1679804","sourcedb":"PMC","sourceid":"1679804","source_url":"https://www.ncbi.nlm.nih.gov/pmc/1679804","text":"In [5], the structured motif is called a Classes of Characters and Bounded Gaps (CBG) expression and is represented by a non-deterministic ε-automaton with bit parallelism. Two algorithms are proposed for CBG expression search: forward search and backward search. Bit parallelism speeds up the search, but is adequate only for a pattern whose maximum span is smaller than the length of the computer word. Also the implementation of CBG can only handle such pattern. This limits the application of CBG to searching for patterns with small number of symbols and gaps.","tracks":[{"project":"2_test","denotations":[{"id":"17118189-14980017-1688069","span":{"begin":4,"end":5},"obj":"14980017"}],"attributes":[{"subj":"17118189-14980017-1688069","pred":"source","obj":"2_test"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"2_test","color":"#eca293","default":true}]}]}}