{'fraction_non_alphanumeric': 0.01338432122370937, 'fraction_numerical': 0.0, 'mean_word_length': 5.933774834437086, '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}}
Individual haplotyping prediction agreements

Haplotype problems find important applications in various fields of human genetics. Modern sequencing technologies have significantly improved accuracy of reconstruction using individual's DNA short fragments. The objective of individual haplotype reconstruction algorithms is to design algorithms that rebuild the most likely copies of each chromosome from a set of given short fragments. The performance of the haplotype algorithms are often measured by comparing the reconstructed haplotypes with the original short fragments, using Minimum Error Correction measurement. Yet, there is no evidence in the literature about the level of agreement in all the solutions to the individual haplotyping problem. In other words, it is unknown if different haplotype algorithms coincide on the reconstructed/predicted haplotypes. In this paper, we investigate the problem of haplotyping prediction agreement by comparing the haplotypes produced by a number of well-known haplotype reconstruction algorithms.