-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
5eaa8cc
commit cd386bf
Showing
1 changed file
with
2 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,5 @@ | ||
 | ||
|
||
The idea of this project is to "learn" regulated promoter models, based on a set of user-provided sequences (referred to as the positive set), using a restricted Genetic Programming framework. The _restriction_ in this setup is that the models to be evolved are not open tree topologies (see [previous iteration](https://github.com/ErillLab/TF_GA) of the project), but chains connecting _recognizers_ via binary _connectors_. | ||
The idea of this project is to "learn" regulated promoter models, based on a set of user-provided sequences (referred to as the positive set), using an evolutionary algorithm. The _restriction_ in this setup is that the models to be evolved are not open tree topologies (see [previous iteration](https://github.com/ErillLab/TF_GA) of the project), but chains connecting _recognizers_ via binary _connectors_. | ||
|
||
The GP framework is tasked with evolving organisms that "bind" the positive dataset preferentially over a control dataset (referred to as the negative dataset). Optimal binding energies for the organisms on each sequence are computed using a variant of the Needleman–Wunsch algorithm. | ||
The algorithm is tasked with evolving organisms that "bind" the positive dataset preferentially over a control dataset (referred to as the negative dataset). Optimal binding energies for the organisms on each sequence are computed using a specific dynamic programming algorithm. |