Longest Biased Interval and Longest Non-negative Sum Interval
نویسنده
چکیده
UNLABELLED Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. 'at least 0.95 (A+T)-rich'. It is based on an algorithm to find the longest interval having a non-negative sum in a sequence of positive and negative numbers. In practice, it runs in linear time; this can be guaranteed if the bias is rational. AVAILABILITY Java code of the algorithm can be found at http://www.csse.monash.edu.au/~lloyd/tildeProgLang/Java2/Biased/. SUPPLEMENTARY INFORMATION Examples of applications to Plasmodium falciparum genomic DNA can be found at the above URL.
منابع مشابه
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
In this work, we obtain the following new results: – Given a tree T = (V, E) with a length function ` : E → R and a weight function w : E → R, a positive integer k, and an interval [L, U ], the Weight-Constrained k Longest Paths problem is to find the k longest paths among all paths in T with weights in the interval [L,U ]. We show that the Weight-Constrained k Longest Paths problem has a lower...
متن کاملA GENERALIZATION OF ZECKENDORF’S THEOREM VIA CIRCUMSCRIBED m-GONS
Zeckendorf’s theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy Fn = Fn−1 + Fn−2 for n ≥ 3, F1 = 1 and F2 = 2. The distribution of the number of summands in such decomposition converges to a Gaussian, the gaps between summands converges to geometric decay, and the distribution of the longest gap...
متن کاملA note on "An interval type-2 fuzzy extension of the TOPSIS method using alpha cuts"
The technique for order of preference by similarity to ideal solution (TOPSIS) is a method based on the ideal solutions in which the most desirable alternative should have the shortest distance from positive ideal solution and the longest distance from negative ideal solution. Depending on type of evaluations or method of ranking, different approaches have been proposing to calculate distances ...
متن کاملTwo Lower Bounds for Multi-Label Interval Routing
Interval routing is a space-efficient method for point-to-point networks. The method has been incorporated in the design of a commercially available routing chip [7], and is a basic element in some compact routing methods (e.g., [4]). With up to one interval label per edge, the method has been shown to be nonoptimal for arbitrary graphs [9, 13], where optimality is measured in terms of the long...
متن کاملPolynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs
We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus on a fundamental graph problem: Longest Path, that is, given an undirected graph, find a maximum-length path in G. Longest Path is NP-hard in general but kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 19 10 شماره
صفحات -
تاریخ انتشار 2003