The mutated subsequence problem and locating conserved genes
Author(s) -
H. L. Chan,
TakWah Lam,
WingKin Sung,
Prudence W. H. Wong,
SiuMing Yiu,
Xiangyang Fan
Publication year - 2005
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/bti371
Subject(s) - subsequence , genome , gene , genetics , computational biology , human genome , biology , computer science , mathematics , mathematical analysis , bounded function
For the purpose of locating conserved genes in a whole genome scale, this paper proposes a new structural optimization problem called the Mutated Subsequence Problem, which gives consideration to possible mutations between two species (in the form of reversals and transpositions) when comparing the genomes.
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