Results 1 to 10 of about 2,433,680 (345)
Introducing difference recurrence relations for faster semi-global alignment of long sequences. [PDF]
BMC Bioinformatics, 2018 The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic
Suzuki H, Kasahara M.
europepmc +2 more sources
Recurrence relations for the midpoint method
Tamkang Journal of Mathematics, 2000 In this paper, we present a new convergence analysis and error estimates for the Midpoint method in Banach spaces by using Newton-Kantorovich-type assumptions and a technique based on a new system of recurrence relations. Finally, we give three examples where we improve the error bounds are better given by other authors.
J.A. Ezquerro +2 more
openalex +5 more sources
Recurrence relations for exceptional Hermite polynomials [PDF]
Journal of Approximation Theory, 2015 The bispectral anti-isomorphism is applied to differential operators involving elements of the stabilizer ring to produce explicit formulas for all difference operators having any of the Hermite exceptional orthogonal polynomials as eigenfunctions with eigenvalues that are polynomials in $x$.
D. Gómez‐Ullate +3 more
semanticscholar +6 more sources
Nested Recurrence Relations with Conolly-like Solutions [PDF]
SIAM Journal on Discrete Mathematics, 2012 A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the 2-adic ...
Alejandro Erickson +4 more
openalex +3 more sources
Recurrence Relations and Determinants
, 2011 We examine relationships between two minors of order n of some matrices of n rows and n+r columns. This is done through a class of determinants, here called $n$-determinants, the investigation of which is our objective. We prove that 1-determinants are the upper Hessenberg determinants.
Milan Janjić
openalex +4 more sources
Fractal and Fractional, 2021 The purpose of this paper is to develop some new recurrence relations for the two parametric Mittag-Leffler function. Then, we consider some applications of those recurrence relations.
Dheerandra Shanker Sachan +2 more
doaj +1 more source
Three- and four-term recurrence relations for Horn's hypergeometric function $H_4$
Research in Mathematics, 2022 Three- and four-term recurrence relations for hypergeometric functions of the second order (such as hypergeometric functions of Appell, Horn, etc.) are the starting point for constructing branched continued fraction expansions of the ratios of these ...
R. Dmytryshyn, I.-A.V. Lutsiv
semanticscholar +1 more source
Dynaplex: analyzing program complexity using dynamically inferred recurrence relations
Proc. ACM Program. Lang., 2021 Being able to detect program runtime complexity is useful in many tasks (e.g., checking expected performance and identifying potential security vulnerabilities).
Didier Ishimwe +2 more
semanticscholar +1 more source
A Recurrence Related to Trees [PDF]
Proceedings of the American Mathematical Society, 1989 The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer coefficients, which may be called the "tree polynomials."
Boris Pittel, Donald E. Knuth
openaire +2 more sources
RECURRENCE RELATIONS FOR SOBOLEV ORTHOGONAL POLYNOMIALS
Проблемы анализа, 2020 We consider recurrence relations for the polynomials orthonormal with respect to the Sobolev-type inner product and generated by classical orthogonal polynomials, namely: Jacobi polynomials, Legendre polynomials, Chebyshev polynomials of the first and ...
M. S. Sultanakhmedov
doaj +1 more source