{'fraction_non_alphanumeric': 0.0407673860911271, 'fraction_numerical': 0.07913669064748201, 'mean_word_length': 4.9714285714285715, '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}}
Graphical approach to analyzing DNA sequences

Recently, we proposed a 2D graphical representation of DNA sequence [J Comput Chem 25(2004) 1364–1368]. Based on this representation, we outline one approach to search optimal alignment. We also can judge the mutations between bases and an unknown sequence based on its graph and a known sequence's graph. © 2005 Wiley Periodicals, Inc. J Comput Chem 26: 1519–1523, 2005