TY - CHAP
T1 - Searching for regulatory elements of alternative splicing events using phylogenetic footprinting
AU - Shigemizu, Daichi
AU - Maruyama, Osamu
PY - 2004
Y1 - 2004
N2 - We consider the problem of finding candidates for regulatory elements of alternative splicing events from orthologous genes, using phylogenetic footprinting. The problem is formulated as follows: We are given orthologous sequences P1, . . . , Pa and N1, . . . , N b from a + b different species, and a phylogenetic tree relating these species. Assume that for i = 1, . . . , a, Pi is known to have some alternative splicing events, although Nj does not have any alternative splicing events. Our objective is to find all sets of substrings s1, . . . , sa of P1, . . . , Pa such that s1, . . . ,sa are similar to each other to some extent, and such that any substrings of N1, . . . , Nb are not similar to s1, . . . , sa. To this aim, we have modified the phylogenetic footprinting algorithm given by Blanchette et al. to solve our problem. We report the results of our preliminary computational experiments on several sets of orthologous genes of the five species, H.sapiens, M.musculus, D.melanogaster, C.elegans, and A.thaliana. It is interesting that many of the substrings selected by our algorithm from the coding sequences of H.sapiens are substrings in the intronic sequences flanking the alternatively spliced exons of the coding sequence. This result implies that regulatory elements of alternative splicing events would be located in intronic sequences flanking the alternatively spliced exons.
AB - We consider the problem of finding candidates for regulatory elements of alternative splicing events from orthologous genes, using phylogenetic footprinting. The problem is formulated as follows: We are given orthologous sequences P1, . . . , Pa and N1, . . . , N b from a + b different species, and a phylogenetic tree relating these species. Assume that for i = 1, . . . , a, Pi is known to have some alternative splicing events, although Nj does not have any alternative splicing events. Our objective is to find all sets of substrings s1, . . . , sa of P1, . . . , Pa such that s1, . . . ,sa are similar to each other to some extent, and such that any substrings of N1, . . . , Nb are not similar to s1, . . . , sa. To this aim, we have modified the phylogenetic footprinting algorithm given by Blanchette et al. to solve our problem. We report the results of our preliminary computational experiments on several sets of orthologous genes of the five species, H.sapiens, M.musculus, D.melanogaster, C.elegans, and A.thaliana. It is interesting that many of the substrings selected by our algorithm from the coding sequences of H.sapiens are substrings in the intronic sequences flanking the alternatively spliced exons of the coding sequence. This result implies that regulatory elements of alternative splicing events would be located in intronic sequences flanking the alternatively spliced exons.
UR - http://www.scopus.com/inward/record.url?scp=35048851025&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35048851025&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30219-3_13
DO - 10.1007/978-3-540-30219-3_13
M3 - Chapter
AN - SCOPUS:35048851025
SN - 3540230181
SN - 9783540230182
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 147
EP - 158
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Jonassen, Inge
A2 - Kim, Junhyong
PB - Springer Verlag
ER -