Search results for "Cograph"
showing 10 items of 134 documents
A bijection between words and multisets of necklaces
2012
Two of the present authors have given in 1993 a bijection Phi between words on a totally ordered alphabet and multisets of primitive necklaces. At the same time and independently, Burrows and Wheeler gave a data compression algorithm which turns out to be a particular case of the inverse of Phi. In the present article, we show that if one replaces in Phi the standard permutation of a word by the co-standard one (reading the word from right to left), then the inverse bijection is computed using the alternate lexicographic order (which is the order of real numbers given by continued fractions) on necklaces, instead of the lexicographic order as for Phi(-1). The image of the new bijection, ins…
Some properties of vertex-oblique graphs
2016
The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…
On the regularity of circular splicing languages : A survey and new developments
2009
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focus on the relationship between regular circular languages and languages generated by finite circular splicing systems. We survey the known results towards a characterization of the intersection between these two classes and provide new contributions on the open problem of finding this characterization. First, we exhibit a non-regular circular language generated by a circular simple system thus disproving a known result in this area. Then we give new results related to a restrictive class of circular splicing systems…
Universal Lyndon Words
2014
A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
Analysis of documentary and terminological needs of doctors and medical translators as a basis for the development of a next-generation multilingual …
2014
En el presente trabajo se plantea el diseño de un recurso lexicográfico multilingüe orientado a médicos y traductores médicos. En la actualidad, no existe ningún recurso que satisfaga a ambos colectivos por igual, debido a que estos poseen necesidades muy diferentes. Sin embargo, partimos de la premisa de que se podría crear una herramienta única, modular, adaptable y flexible, que responda a sus diversas expectativas, necesidades y preferencias. Se parte para ello de un análisis de necesidades siguiendo el método empírico de recogida de datos en línea mediante una encuesta trilingüe. The objective of this study is to develop a multilingual lexicographical resource aimed at doctors and medi…
A Multi-Objective Approach to Optimize a Periodic Maintenance Policy
2012
The present paper proposes a multi-objective approach to find out an optimal periodic maintenance policy for a repairable and stochastically deteriorating multi-component system over a finite time horizon. The tackled problem concerns the determination of the system elements to replace at each scheduled and periodical system inspection by ensuring the simultaneous minimization of both the expected total maintenance cost and the expected global system unavailability time. It is assumed that in the case of system elements failure they are instantaneously detected and repaired by means of minimal repair actions in order to rapidly restore the system. A nonlinear integer mathematical programmi…
On generalized Lyndon words
2018
Abstract A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as a nonincreasing factorization of generalized Lyndon words. We give new characterizations of the first and the last factor in this factorization as well as new characterization of generalized Lyndon words. We also give more specific results on two special cases: the classical one and the one arising from the alternating lexicographical order.
MR imaging of perianal Crohn’s disease: Is contrast medium necessary?
2010
Purpose Methods and Materials Results Conclusion References Personal Information
The database of evidential markers in European languages. A bird’s eye view of the conception of the database (the template and problems hidden benea…
2010
Abstract This introduction not only browses through the contributions of the whole issue, but also attempts to set the stage for a cross-linguistically unified study of evidentiality markers to be registered in a database. This endeavor has so far been restricted to European languages. We assume evidentiality to be a conceptual domain and, on this basis, want to account for diverse units irrespective of their morphological format and status in the particular language’s grammar. Evidential markers are claimed to be locatable on a lexicon – grammar cline, ranging from distinct lexical units (accessed holistically) to grammatical morphology (having been the subject of traditional descriptions …