Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1995-1999  (3)
  • Berlekamp-Massey algorithm  (2)
  • Key words: Spectrin — Substitution pattern — Substitution rate — Elliptocytosis — Spherocytosis — Maximum likelihood — Gene duplication  (1)
Source
Material
Years
  • 1995-1999  (3)
Year
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    Comparisons of the Nucleotide Substitution Process Among Repetitive Segments of the α- and β-Spectrin Genes (1997)
    Springer
    Journal of molecular evolution 44 (1997), S. 492 -500 
    Details
    ISSN: 1432-1432
    Keywords: Key words: Spectrin — Substitution pattern — Substitution rate — Elliptocytosis — Spherocytosis — Maximum likelihood — Gene duplication
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract. The actin–cross-linking protein spectrin is a prominent component of the membrane cytoskeleton. Spectrin is a tetramer of two antiparallel αβ-dimers which share a unique and ancient gene structure. The α-spectrin and β-spectrin genes are composed primarily of tandemly repeated 106-amino-acid segments, each of which forms a triple α-helical coiled coil. Both the genes and the repeats themselves are homologous. The two genes are thought to be the result of a gene duplication event, and each gene is the product of duplications of the 106-amino-acid repeats. In this work we compare the process of molecular evolution across the repeated segments of the α- and β-spectrin genes. We find that the α-spectrin segments have, for the most part, evolved in a homogeneous fashion, while considerable heterogeneity is found among β-spectrin segments. Several segments with unique known functions are found to have evolved differently than the others. On the basis of heterogeneity of the evolutionary process, we suggest that at least one repeat has a unique function that has yet to be documented. We also present new statistical methods for comparing the evolutionary process between different regions of DNA sequences.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00006173
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 309-323 
    Details
    ISSN: 1432-0622
    Keywords: Polynomial remainder sequence ; Berlekamp-Massey algorithm ; linear recurring sequence ; factorial domain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract We present an extended polynomial remainder sequence algorithm XPRS for R[X] whereR is a domain. From this we derive a Berlekamp-Massey algorithm BM/R overR. We show that if (α) is a linear recurring sequence in a factorial domainU, then the characteristic polynomials for (α) form aprincipal ideal which is generated by a primitive minimal polynomial. Moreover, this generator ismonic when U[[X]] is factorial (for example, whenU is Z orK[X 1,X2,...,Xn] whereK is a field). From XPRS we derive an algorithm MINPOL for determining the minimal polynomial of (α) when an upper bound on the degree of some characteristic polynomial and sufficiently many initial terms of (α) are known. We also show how to obtain a Berlekamp-Massey type minimal polynomial algorithm from BM/U and state BM_MINPOL/K explicitly with a further refinement. Examples are given forU=Z, GF(2)[Y].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01235722
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain (1995)
    Springer
    Applicable algebra in engineering, communication and computing 6 (1995), S. 309-323 
    Details
    ISSN: 1432-0622
    Keywords: Keywords: Polynomial remainder sequence ; Berlekamp-Massey algorithm ; linear recurring sequence ; factorial domain.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract.  We present an extended polynomial remainder sequence algorithm XPRS for R[X] where R is a domain. From this we derive a Berlekamp-Massey algorithm BM/R over R. We show that if (α) is a linear recurring sequence in a factorial domain U, then the characteristic polynomials for (α) form a principal ideal which is generated by a primitive minimal polynomial. Moreover, this generator is monic when U[ [X] ] is factorial (for example, when U is Z or K[X 1 , X 2 , . . . , X n ] where K is a field). From XPRS we derive an algorithm MINPOL for determining the minimal polynomial of (α) when an upper bound on the degree of some characteristic polynomial and sufficiently many initial terms of (α) are known. We also show how to obtain a Berlekamp-Massey type minimal polynomial algorithm from BM/U and state BM – MINPOL/K explicitly with a further refinement. Examples are given for U = Z, GF(2) [Y ].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002000050008
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...