Sciweavers

73 search results - page 1 / 15
» Positivity of second order linear recurrent sequences
Sort
View
DAM
2006
66views more  DAM 2006»
13 years 11 months ago
Positivity of second order linear recurrent sequences
We give an elementary proof for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has ...
Vesa Halava, Tero Harju, Mika Hirvensalo
BMCBI
2010
124views more  BMCBI 2010»
13 years 11 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
ISCAS
2007
IEEE
128views Hardware» more  ISCAS 2007»
14 years 5 months ago
Analysis of Second-Order Modes of Linear Continuous-Time Systems under Positive-Real Transformations
Abstract— This paper discusses the behavior of the secondorder modes of linear continuous-time systems under variable transformations with positive-real functions. We first disc...
Shunsuke Koshita, Yousuke Mizukami, Taketo Konno, ...
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 10 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 11 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers