@inproceedings{e7f0df3f6f724b54ba58c5926154db0c,
title = "A linear-time algorithm for studying genetic variation",
abstract = "The study of variation in DNA sequences, within the framework of phylogeny or population genetics, for instance, is one of the most important subjects in modern genomics. We here present a new lineartime algorithm for finding maximal k-regions in alignments of three sequences, which can be used for the detection of segments featuring a certain degree of similarity, as well as the boundaries of distinct genomic environments such as gene clusters or haplotype blocks, k-regions are defined as these which have a center sequence whose Hamming distance from any of the alignment rows is at most k, and their determination in the general case is known to be NP-hard.",
author = "Nikola Stojanovic and Piotr Berman",
year = "2006",
doi = "10.1007/11851561_32",
language = "English (US)",
isbn = "3540395830",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "344--354",
booktitle = "Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings",
address = "Germany",
note = "6th International Workshop on Algorithms in Bioinformatics, WABI 2006 ; Conference date: 11-09-2006 Through 13-09-2006",
}