|
23 July 2003
Finding patterns of non-continuous characters with a given
gap region from DNA sequences
Speaker: ZHANG Minghua
Abstract
The development of bioinformatics provides us with a lot of data, such
as DNA sequences. Nowadays people are trying to discovery useful
information from the huge amounts of data. As we know, DNA sequences are
of double-helix structure. For a nucleotides in a DNA sequence, after a
helix turn, there exists another nucleotide shares a similar orientation
as the previous one. The distance between the two nucleotides is a
variable whose domain is normally a small region. When a molecule binds to
a DNA sequence, it may take direct contacts with the nucleotides of the
same orientation simultaneously. Therefore, the patterns composed of these
nucleotides that appear frequent enough may contain valuable information
for biologist.
In this talk, we formally define the problem we mention above, and
present several straightforward algorithms for solving it. We point out
the disadvantages of the algorithms, and present ideas of how to overcome
the shortcomings.
Read the Presentation
Slides...
Referred Papers
|
