"
Team:USTC Software/project
From 2010.igem.org
(→Chain Sorting and Weighting Scheme) |
(→Chain Sorting and Weighting Scheme) |
||
| Line 3: | Line 3: | ||
preferred to another, since in a complex of multiple chains, which are connected via binding interaction of binding bites on their own, all chains are equivalent. However, a chain-sorting program is a prerequisite for implementations of many other functions, such as comparison of two Chain-Node structures, or pattern matching of template species to those with definite structure. | preferred to another, since in a complex of multiple chains, which are connected via binding interaction of binding bites on their own, all chains are equivalent. However, a chain-sorting program is a prerequisite for implementations of many other functions, such as comparison of two Chain-Node structures, or pattern matching of template species to those with definite structure. | ||
| - | Sorting is always performed under some rules. | + | |
| + | Sorting is always performed under some rules. Since there are no natural options, we design one to generate the unique order for a list of chains. The rule we developed is something like that for comparing two strings: comparing first the database '''id''' and part type of the first part of two chains in alphabet order and if equal, then comparing the next until there are differences or to the end of either chain. For convenience, we generate a unique code (a string) for each chain by putting their database '''id''' and part type one by one, for example, | ||
| + | |||
| + | [placI185:ForwardDNA][RBS147:forwardDNA][lacI153:ForwardDNA][TE145:ForwardDNA]... | ||
Revision as of 01:10, 11 October 2010
Chain Sorting and Weighting Scheme
Chains in our Chain-Node Model should not have any order since there are no natural ways to sort them. One chain is not preferred to another, since in a complex of multiple chains, which are connected via binding interaction of binding bites on their own, all chains are equivalent. However, a chain-sorting program is a prerequisite for implementations of many other functions, such as comparison of two Chain-Node structures, or pattern matching of template species to those with definite structure.
Sorting is always performed under some rules. Since there are no natural options, we design one to generate the unique order for a list of chains. The rule we developed is something like that for comparing two strings: comparing first the database id and part type of the first part of two chains in alphabet order and if equal, then comparing the next until there are differences or to the end of either chain. For convenience, we generate a unique code (a string) for each chain by putting their database id and part type one by one, for example,
[placI185:ForwardDNA][RBS147:forwardDNA][lacI153:ForwardDNA][TE145:ForwardDNA]...
