`\\sharp\"$ for separation: $S_1\\sharp S_2\\sharp\\ldots\\sharp S_n$. The running time complexity of our algorithm is O(DN2) where N=|S1|+|S2|+⋯+|Sn|.","description":"We study the problem of approximate non-tandem repeat (conserved regions) extraction among strings (genes). Basically, given a string S and thresholds L and D over a finite alphabet, extracting approximate repeats is to find pairs (β, β′) of substrings of S under some constraints such that β and β′…","datePublished":"2006","isPartOf":{"@type":"Periodical","name":"Computational Life Sciences II"},"publisher":{"@type":"Organization","name":"Springer Berlin Heidelberg"},"sameAs":"https://doi.org/10.1007/11875741_5","identifier":"10.1007/11875741_5","encoding":{"@type":"MediaObject","contentUrl":"https://libdis.com/api/pdf/YYRT4ooBnJwnONLTqDBE","encodingFormat":"application/pdf"},"keywords":"Combinatorics, Theoretical computer science, Mathematics, Algorithm"}