We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original substring; this is close to the situation of DNA, for example. Typically there are many explanations for a given string under the model, some optimal and many suboptimal. Rather than commit to one optimal explanation,...

aim : evaluation of biological characteristics of 13 identified proteins of patients with cirrhotic liver disease is the main aim of this research.   background : in clinical usage, liver biopsy remains the gold standard for diagnosis of hepatic fibrosis. evaluation and confirmation of liver fibrosis stages and severity of chronic diseases require a precise and noninvasive biomarkers. since the...

We introduce a very early universe model based on the thermodynamics of gas closed strings in background that is nonperturbative ${\ensuremath{\alpha}}^{\ensuremath{'}}$. Upon considering fully ${\ensuremath{\alpha}}^{\ensuremath{'}}$-corrected equations extended to include certain anisotropic cosmological backgrounds, we describe evolution system three different stages parametrized by gas's eq...

A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than the input sequences and quickly outgrow the main memory, the first attempts at building large suffix trees focused on algo...