Faster genome mapping method using 4-ary Perfect Linear Code
| Project/Area Number |
24650155
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Bioinformatics/Life informatics
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
|
|---|
| Keywords | ゲノム / 完全線形符号 / 次世代シークエンサー / DNA配列 / ガロア拡大体 / ゲノムマッピング / アライメント |
|---|
| Outline of Final Research Achievements |
The emerging of the next generation DNA sequencers enables us to get an extraordinary amount of DNA short sequences and read their bases. The data size comes bigger and bigger year by year and the increase ratio overwhelms the Moore’s law. This requires new algorithms and mechanism to manipulate the short read faster. This research proposed that 4-ary perfect linear code meets the demand. The DNA sequences are coded to one of the code words of the perfect linear code and we proved that it reduces the search space when we try to find DNA subsequences that is one mismatch from the query DNA sequence. Then we have shown that the perfect linear code is useful to genome mapping and metagenome analyses.
|
Report
(5 results)
Research Products
(16 results)
