347,149 research outputs found

    Sequences defined by h-vectors

    Full text link
    In this paper we consider the sequence whose n^{th} term is the number of h-vectors of length n. We show that the n^{th} term of this sequence is bounded above by the n^{th} Fibonacci number and bounded below by the number if integer partitions of n into distinct parts. Further we show embedded sequences that directly relate to integer partitions

    Prediction of peptide and protein propensity for amyloid formation

    Get PDF
    Understanding which peptides and proteins have the potential to undergo amyloid formation and what driving forces are responsible for amyloid-like fiber formation and stabilization remains limited. This is mainly because proteins that can undergo structural changes, which lead to amyloid formation, are quite diverse and share no obvious sequence or structural homology, despite the structural similarity found in the fibrils. To address these issues, a novel approach based on recursive feature selection and feed-forward neural networks was undertaken to identify key features highly correlated with the self-assembly problem. This approach allowed the identification of seven physicochemical and biochemical properties of the amino acids highly associated with the self-assembly of peptides and proteins into amyloid-like fibrils (normalized frequency of β-sheet, normalized frequency of β-sheet from LG, weights for β-sheet at the window position of 1, isoelectric point, atom-based hydrophobic moment, helix termination parameter at position j+1 and ΔGº values for peptides extrapolated in 0 M urea). Moreover, these features enabled the development of a new predictor (available at http://cran.r-project.org/web/packages/appnn/index.html) capable of accurately and reliably predicting the amyloidogenic propensity from the polypeptide sequence alone with a prediction accuracy of 84.9 % against an external validation dataset of sequences with experimental in vitro, evidence of amyloid formation

    Pure O-sequences and matroid h-vectors

    Full text link
    We study Stanley's long-standing conjecture that the h-vectors of matroid simplicial complexes are pure O-sequences. Our method consists of a new and more abstract approach, which shifts the focus from working on constructing suitable artinian level monomial ideals, as often done in the past, to the study of properties of pure O-sequences. We propose a conjecture on pure O-sequences and settle it in small socle degrees. This allows us to prove Stanley's conjecture for all matroids of rank 3. At the end of the paper, using our method, we discuss a first possible approach to Stanley's conjecture in full generality. Our technical work on pure O-sequences also uses very recent results of the third author and collaborators.Comment: Contains several changes/updates with respect to the previous version. In particular, a discussion of a possible approach to the general case is included at the end. 13 pages. To appear in the Annals of Combinatoric

    Generic and special constructions of pure O-sequences

    Full text link
    It is shown that the h-vectors of Stanley-Reisner rings of three classes of matroids are pure O-sequences. The classes are (a) matroids that are truncations of other matroids, or more generally of Cohen-Macaulay complexes, (b) matroids whose dual is (rank + 2)-partite, and (c) matroids of Cohen-Macaulay type at most five. Consequences for the computational search for a counterexample to a conjecture of Stanley are discussed.Comment: 16 pages, v2: various small improvements, accepted by Bulletin of the London Math. Societ

    Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences

    Full text link
    The concept of symbolic sequences play important role in study of complex systems. In the work we are interested in ultrametric structure of the set of cyclic sequences naturally arising in theory of dynamical systems. Aimed at construction of analytic and numerical methods for investigation of clusters we introduce operator language on the space of symbolic sequences and propose an approach based on wavelet analysis for study of the cluster hierarchy. The analytic power of the approach is demonstrated by derivation of a formula for counting of {\it two-fold de Bruijn sequences}, the extension of the notion of de Bruijn sequences. Possible advantages of the developed description is also discussed in context of applied
    • …
    corecore