Complexity reduction in context-dependent DNA substitution models
Author(s) -
William H. Majoros,
Uwe Ohler
Publication year - 2008
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btn598
Subject(s) - computer science , context (archaeology) , computational complexity theory , inference , reduction (mathematics) , substitution (logic) , generalization , computational model , machine learning , artificial intelligence , task (project management) , theoretical computer science , algorithm , mathematics , biology , paleontology , mathematical analysis , geometry , programming language , management , economics
The modeling of conservation patterns in genomic DNA has become increasingly popular for a number of bioinformatic applications. While several systems developed to date incorporate context-dependence in their substitution models, the impact on computational complexity and generalization ability of the resulting higher order models invites the question of whether simpler approaches to context modeling might permit appreciable reductions in model complexity and computational cost, without sacrificing prediction accuracy.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom