Research Project
Grant-in-Aid for Scientific Research (B)
We developed an algorithm for enumerating frequent approximate string patterns, and proposed a method of extracting occurrence regions of the enumerated patterns as a method of extracting interspersed repetitive elements in a huge sequence like a DNA sequence. Patterns of proposed methods have occurrences of clear boundaries, so there is little chance to count essentially the same region more than once. Furthermore, our enumeration algorithm runs very fast and with small memory. According to our empirical results using human chromosome 21, a half of the known Alu regions, which are famous interspersed repetitive elements, is extracted as occurrence regions of 100 representative patterns that were selected from enumerated frequent approximate patterns.
All 2016 2015 2014 2013
All Journal Article (11 results) (of which Int'l Joint Research: 1 results, Peer Reviewed: 8 results, Acknowledgement Compliant: 6 results, Open Access: 2 results) Presentation (6 results) (of which Invited: 1 results)
Discrete Applied Mathematics
Volume: 200 Pages: 123-152
10.1016/j.dam.2015.07.002
Lecture Notes in Computer Science
Volume: 9618 Pages: 412-423
10.1007/978-3-319-30000-9_32
130008061481
Operations Research Letters
Volume: 43(6) Issue: 6 Pages: 558-563
10.1016/j.orl.2015.08.008
Volume: 9356 Pages: 275-283
10.1007/978-3-319-24282-8_23
Volume: 9132 Pages: 27-37
10.1007/978-3-319-20248-8_3
Nature Commun.
Volume: 5 Issue: 1 Pages: 5941-5941
10.1038/ncomms6941
120005621881
JMLR: Workshop and Conference Proceedings
Volume: 39 Pages: 315-329
Theoretical Computer Science
Volume: 530 Pages: 23-41
10.1016/j.tcs.2014.02.022
120005593436
人工知能基本問題研究会
Volume: 93 Pages: 45-48
Volume: 92 Pages: 35-40
電子情報通信学会技術研究報告
Volume: COMP113(198) Pages: 9-16