{'fraction_non_alphanumeric': 0.03473053892215569, 'fraction_numerical': 0.0, 'mean_word_length': 4.846153846153846, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A molecular computing model for maximal clique problem using circular DNA length growth

A novel DNA computing model based on circular DNA length growth (CDLG) is developed to solve a maximal clique problem (MCP) with n-vertices. The time complexity of biological operations required is O(n+m) (m is the number of edges of the complementary graph), and the space complexity is O(n+m). The main feature of this model is using circular single-stranded DNA (c-ssDNA) to implement the computation on the nano-scale. By the CDLG method, the target DNA molecules will grow in length just when they satisfy the conditions. To verify the algorithm, a small paradigm is calculated by the nano-scale DNA computing model. The computing achievement by circular DNA demonstrates the potential ability of DNA computing to solve NP-complete problems.