Similar sequences
نویسندگان
چکیده
منابع مشابه
Querying highly similar sequences
In this paper, we present a solution to the extreme similarity sequencing problem. The extreme similarity sequencing problem consists of finding occurrences of a pattern p in a set S(0), S(1), , S(k), of sequences of equal length, where S(i), for all 1≤i≤k, differs from S(0) by a constant number of errors - around 10 in practice. We present an asymptotically fast O(n + occ logocc) time algorit...
متن کاملIndexing Similar DNA Sequences
To study the genetic variations of a species, we need to consider a large number of very similar genomic sequences (e.g., a set of genes from normal people and different patients). A basic operation is to search the occurrences of a given pattern in these sequences. A straightforward approach is to concatenate these sequences as a long text, then build an indexing data structure (e.g., suffix t...
متن کاملLooking for Similar Patterns in Genomic Sequences
Genomics is opening many interesting practical and theoretical computational problems; one of them is the search for a collection of genomic regions at given distances from each other, i.e., a pattern of genomic regions. We designed and implemented an optimized patternsearch algorithm able to find efficiently, within a large set of genomic data, genomic region sequences which are similar to a g...
متن کاملFinding Similar Regions in Many Sequences
1 1 Some of the results in this paper have appeared as a part of an extended abstract presented in ''Proc. Algorithms for finding similar, or highly conserved, regions in a group of sequences are at the core of many molecular biology problems. Assume that we are given n DNA sequences s 1 , ..., s n. The Consensus Patterns problem, which has been widely studied in bioinformatics research, in its...
متن کاملCongruences for sequences similar to Euler numbers
For a 6= 0 we define {E n } by ∑ k=0 ( n 2k ) a2kE n−2k = (1− a)n (n = 0,1,2, . . .), where [n/2] = n/2 or (n−1)/2 according as 2 | n or 2 n. In the paper we establish many congruences for E n modulo prime powers, and show that there is a set X and a map T : X → X such that (−1)nE 2n is the number of fixed points of T n. MSC: Primary 11B68, Secondary 11A07
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1933
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1933-05773-7