The integrity of complex software systems built from existing components is becoming more dependent on the integrity of the mechanisms used to interconnect these components and, in particular, on the ability of these mechanisms to cope with architectural mismatches that might exist between components. There is a need to detect and handle (i.e. to tolerate) architectural mismatches during runtim...

Although HLA matching is beneficial in clinical transplantation, it is not feasible to select a completely HLA matched donor for every potential recipient because of the enormous polymorphism of the HLA system. As a consequence, the majority of the recipients will be transplanted with a mismatched donor organ or hematopoietic stem cell transplant. For this large group of patients it is importan...

UNLABELLED The objective of this study is to propose a model of matching errors for identifying mismatches in alignments of large anatomical ontologies. Meth-ods: Three approaches to identifying mismatches are utilized: 1) lexical, based on the presence of modifiers in the names of the concepts aligned; 2) structural, identifying conflicting relations resulting from the alignment; and 3) semant...

Heteroduplex DNA substrates containing a 4- or 7-base-pair insertion/deletion mismatch or each of the eight possible single-base-pair mismatches were constructed. Extracts of mitotic Saccharomyces cerevisiae cells catalyzed the correction of mismatched nucleotides in a reaction that required Mg2+ and had a partial requirement for ATP and the four dNTPs. The insertion/deletion mismatches and the...

The idea of time-interleaved ADCs (TI-ADCs) is old, but it took more than 25 years until the requirements on converters and the possibility of advanced digital post correction made this architecture attractive. We investigate timeinterleaved ADCs with a focus on the involved signal processing. By establishing a discrete-time model of a TI-ADC, we explicitly show that a TI-ADC with mismatches is...

We consider the well known problem of pattern matching under the Hamming distance. Previous approaches have shown how to count the number of mismatches efficiently especially, when a bound is known for the maximum Hamming distance. Our interest is different in that we wish collect a random sample of mismatches of fixed size at each position in the text. Given a pattern p of length m and a text ...

Many naturally occurring RNA structures contain single mismatches. However, the algorithms currently used to predict RNA structure from sequence rely on a minimal set of data for single mismatches, most of which occur rather infrequently in nature. As a result, several approximations and assumptions are used to predict the stability of RNA duplexes containing the most common single mismatches. ...

The use of Commercial Off-The-Shelf (COTS) products in the software development process requires the evaluation of existing COTS products, and then selecting the one that best fits system requirements. In this process, it is inevitable to encounter mismatches between COTS features and system requirements. Mismatches occur as a result of an excess or shortage of COTS capabilities. Many of these ...

Mutation rate is usually found to covary with many life history traits of animals such as body mass, which has been readily explained by the higher number of mutation opportunities per unit time. Although the precise reason for the pattern is not yet clear, to determine the universality of this pattern, we tested whether life history traits impact another form of genetic mutation, the motif mis...

Many domains such as scientific computing and neuroscience require end users to compose heterogeneous computational entities to automate their professional tasks. However, an issue that frequently hampers such composition is datamismatches between computational entities. Although, many composition frameworks today provide support for data mismatch resolution through special-purpose data convert...