"
Team:USTC Software/project
From 2010.igem.org
(Difference between revisions)
(→Headline text) |
(→Chain Sorting and Weighting Scheme) |
||
| Line 1: | Line 1: | ||
== Chain Sorting and Weighting Scheme == | == 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 | 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. | + | 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. | ||
Revision as of 00:42, 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.
