Search results for "string"

IP6K gene identification in plant cells via tag discovery

2010

IP6K gene identification in plant genomes by tag searching

2011

Abstract Background Plants have played a special role in inositol polyphosphate (IP) research since in plant seeds was discovered the first IP, the fully phosphorylated inositol ring of phytic acid (IP6). It is now known that phytic acid is further metabolized by the IP6 Kinases (IP6Ks) to generate IP containing pyro-phosphate moiety. The IP6K are evolutionary conserved enzymes identified in several mammalian, fungi and amoebae species. Although IP6K has not yet been identified in plant chromosomes, there are many clues suggesting its presences in vegetal cells. Results In this paper we propose a new approach to search for the plant IP6K gene, that lead to the identification in plant genome…

Pattern Discovery In Biosequences: From Simple To Complex Patterns

2007

Adding symbolic information to picture models: definitions and properties

2005

AbstractIn the paper we propose extensions of some picture models, such as colored, drawn and pixel pictures. Such extensions are conceived by observing that a picture may embed more information than the shape, such as colors, labels, etc., which can be represented by a symbol from an alphabet and can be associated to segments, points or pixels. New interesting issues derived from the introduction of symbols will be investigated together with some complexity and decidability questions for the proposed extensions.

CHIRAL ANOMALY IN ASHTEKAR'S APPROACH TO CANONICAL GRAVITY

1998

The Dirac equation in Riemann–Cartan spacetimes with torsion is reconsidered. As is well-known, only the axial covector torsion A, a one-form, couples to massive Dirac fields. Using diagrammatic techniques, we show that besides the familiar Riemannian term only the Pontrjagin type four-form dA ∧ dA does arise additionally in the chiral anomaly, but not the Nieh–Yan term d* A, as has been claimed recently. Implications for cosmic strings in Einstein–Cartan theory as well as for Ashtekar's canonical approach to quantum gravity are discussed.

Production of spray-dried proanthocyanidin-rich cinnamon (Cinnamomum zeylanicum) extract as a potential functional ingredient: Improvement of stabili…

2018

International audience; Cinnamon proanthocyanidins present important biological properties. However, these molecules are unstable and possess an astringent taste, which can make their ingestion difficult. In this context, entrapment by spray-drying technology may be used to produce a concentrated extract with improved stability and reduced astringency. Thus, this work aimed to prepare spray-dried microparticles loaded with a proanthocyanidin-rich cinnamon (Cinnamomum zeylanicum) extract (PRCE), immobilized in a maltodextrin matrix. Freeze-dried samples of the extract (without the carrier) were also prepared for comparison. The particles were characterized for moisture content, water activit…

Debates with Small Transparent Quantum Verifiers

2014

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E.

Maximal Closed Substrings

2022

A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right into a longer closed substring. MCSs with exponent at least 2 are commonly called runs; those with exponent smaller than 2, instead, are particular cases of maximal gapped repeats. We show that a string of length n contains O(n1.5) MCSs. We also provide an output-sensitive algorithm that, given a string of length n over a constant-size alphabet, locates all m MCSs the string contains in O(nlog n+ m) time.

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

LR(k) Parsing

1990

In this chapter we shall generalize the notion of strong LL(k) parsing presented in Chapter 5 and consider a method for deterministic left parsing that applies to a slightly wider class of context-free grammars than does the strong LL(k) parsing method. This method will be called “canonical LL(k) parsing”. As in strong LL(k) parsing, the acronym “LL(k)” means that the input string is parsed (1) in a single Left-to-right scan, (2) producing a Left parse, and (3) using lookahead of length k.