In 1969, Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding ...

A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization ...

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, ...

A circular-arc graphG is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is ...

Mutations in the protein alpha-tropomyosin (Tm) can cause a disease known as familial hypertrophic cardiomyopathy. In order to understand how such mutations lead to protein dysfunction, three point mutations were introduced ...

Mutations in the protein alpha-tropomyosin (Tm) can cause a disease known as familial hypertrophic cardiomyopathy. In order to understand how such mutations lead to protein dysfunction, three point mutations were introduced ...

Congo red (CR), one of the most commonly used dyes for the identification of amyloid fibril aggregates, is also a ligand of native bovine serum albumin (BSA). Induced circular dichroism (ICD) is a phenomenon observed when ...