Proteins that bind DNA so as to reduce its end-to-end length can be dissociated by application of force. The thermodynamics of this process are discussed, with special attention to the case of histones bound to DNA (i.e., a string of nucleosomes, or chromatin fiber). The histone octamer is predicted to be driven off chromatin fiber for tensions >2 piconewtons.

The shortest consistent superstring problem is, given a set of positive strings and a set of negative strings, finding a shortest string including every positive string and no negative string as a substrin& This problem is NP-hard and arises in DNA sequencing by hybridization. It is also an extension of the well-known shortest cotillion superstring problem which corresponds to the case when the...

Nuclear DNA of metazoans is organized in supercoiled loops anchored to a proteinaceous substructure known as the nuclear matrix (NM). DNA is anchored to the NM by non-coding sequences known as matrix attachment regions (MARs). There are no consensus sequences for identification of MARs and not all potential MARs are actually bound to the NM constituting loop attachment regions (LARs). Fundament...

We develop topological methods for analyzing difference topology experiments involving 3-string tangles. Difference topology is a novel technique used to unveil the structure of stable protein-DNA complexes involving two or more DNA segments. We analyze such experiments for the Mu protein-DNA complex. We characterize the solutions to the corresponding tangle equations by certain knotted graphs....

The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol of x with another symbol. String editing models a variety of problems arising in such diverse areas as ...

Space efficient storage of large genome sequences requires good compression techniques. However, if these sequences need to be decompressed, before any processing can be done over them, the advantage of compression is lost. New techniques are required to extend the traditional pattern matching algorithms to work directly on the compressed sequence. This saves space in memory, requires less disk...

BACKGROUND The Xpert MTB/RIF (MTB/RIF) test has advanced the field of tuberculosis (TB) diagnostics; however, depending on age and HIV status, 10-85% of individuals with presumed pulmonary TB (PTB) are unable to produce sputum. METHODS The feasibility of using MTB/RIF and culture on stool and string test specimens from 13 adult patients with presumed PTB was studied. RESULTS The string test...

The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text processing, information retrieval, text mining, pattern recognition and DNA sequencing. So we need concurrent events and high performance computing models for extracting the data. This w...

This article presents an approach for synthesizing target strings in a class of computational models of DNA recombination. The computational models are formalized as splicing systems in the context of formal languages. Given a splicing system (of a restricted type) and a target string to be synthesized, we construct (i) a rule-embedded splicing automaton that recognizes languages containing str...