Figure 1From: An algorithm of discovering signatures from DNA databases on a computer clusterThe main routine of the DDCSD algorithm. The algorithm discovers signatures from Λ under the discovery condition (l,d), where l and d are the length and the number of allowed mismatches of the signatures, and, Λ is a dataset made up of l-patterns. |Λ| represents the number of patterns in Λ. N is the preset threshold value for direct discovery.Back to article page