PMC:1679804 / 20986-21798 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":"Several previous efforts have focused on the structured pattern search problem. Anrep [3,4] provides a unified biosequence pattern representation by using network expressions with spacers, where a network expression is a regular expression without Kleene closure. With network expressions, one can specify the scoring scheme and the threshold of approximate matching for each simple motif separately, the positional weights which express the relative importance of different parts of a motif, and whether a simple motif is optional. Anrep introduces a two-step approach: first it searches for simple motifs by a threshold-sensitive motif matching algorithm and then it finds the structured motif by an optimized backtracking matching algorithm. However, as compared by [6], Anrep is much slower than SMARTFINDER.","tracks":[{"project":"2_test","denotations":[{"id":"17118189-8324630-1688067","span":{"begin":87,"end":88},"obj":"8324630"},{"id":"17118189-8697238-1688068","span":{"begin":89,"end":90},"obj":"8697238"}],"attributes":[{"subj":"17118189-8324630-1688067","pred":"source","obj":"2_test"},{"subj":"17118189-8697238-1688068","pred":"source","obj":"2_test"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"2_test","color":"#d0ec93","default":true}]}]}}