CombFold - About ![]() |
|
[ Run | Sample Run | Help ]
|
|
CombFold
predicts which strand from a combinatorial set of strands has the minimum
free energy secondary structure. An example of a combinatorial set of
strands is the set of 8^8 DNA tags used by Brenner for massively
parallel signature sequencing, where each tag is obtained by choosing
8 4mers from the set {TTAC, AATC, TACT, ATCA, ACAT, TCTA, CTTT, CAAA},
(where a tag can be chosen more than once) and concatenating them in any
order. Combinatorial sets of a more general nature, such as those typically
used in DNA computations, can also be handled. Combfold uses a dynamic
programming algorithm to identify its output, thereby avoiding the need
to calculate the free energy of each individual strand in the combinatorial
set.
|
|