{'fraction_non_alphanumeric': 0.02130492676431425, 'fraction_numerical': 0.002663115845539281, 'mean_word_length': 5.266666666666667, '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}}
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences

We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest Common Increasing Subsequence for two random input sequences is reported. It runs in O(m n log p) time complexity and takes space of O(2(m + n + 1) p), where m and n are the length for two input sequences respectively, and p is the length of the final Longest Common Increasing Subsequence. Parallelization allows us to further reduce time and space. This algorithm has significant applications in the area of Computational Biology in manipulating the genomic sequences.