{'fraction_non_alphanumeric': 0.01703800786369594, 'fraction_numerical': 0.0, 'mean_word_length': 5.586206896551724, '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 Hybrid, Recursive Algorithm for Clustering Expressed Sequence Tags in Chlamydomonas reinhardtii

We present an efficient, fully automated algorithm to assemble ESTs into full-length cDNA sequences that represent the complete coding regions of a gene. Our EST clustering algorithm is neither hierarchical nor incremental, but recursive, processing each EST once. The algorithm exploits a variety of syntactic and statistical features of the ESTs. The resulting assembly shows significant improvement in computational efficiency and information extraction over a previous assembly of C. reinhardtii ESTs. The algorithm was developed using iterative and participatory design on C. reinhardtii; however, it can be used for any organism with a draft genomic sequence