A large (and increasing) number of applications require the ability to manipulate sequences of data. While some of these applications use very specialized forms of sequences|e.g., video sequences|there is much to be gained by developing a general framework for managing and querying large sequence data sets. Important target domains include scientiic modelling, stock market and nancial analysis,...

Sequence alignment is an important bioinformatics tool for identifying homology, but searching against the full set of available sequences is likely to result in many hits to poorly annotated sequences providing very little information. Consequently, we often want alignments against a specific subset of sequences: for instance, we are looking for sequences from a particular species, sequences t...

The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many variants of the basic task. We discuss a recently introduced variant of LIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, which improves its time complexity. Moreover, we define a family of similar problems and introduce algorit...

Let Ln be the length of the longest increasing subsequence of a random permutation of the numbers 1, . . . , n, for the uniform distribution on the set of permutations. We discuss the “hydrodynamical approach” to the analysis of the limit behavior, which probably started with Hammersley (1972), and was subsequently further developed by several authors. We also give two proofs of an exact (non-a...

Two-dimensional Lorentzian geometry has recently found application in some models of nonrelativistic systems, most profitably for the process of boarding an aeroplane. The duration of the boarding process is assumed to be a result of passengers standing in the isle and blocking each others’ way. According to this model, the expected boarding time is equal to the length of the longest timelike g...

New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematic and uses Max-Plus idempotent semiring. Problem of finding longest increasing subsequence is reformulated in a matrix form and solved with linear algebra.

world apricot (prunus armeniaca l.)  production is increasing steadily due to breeding of new high yielding cultivars in different countries. more recently, breeding programs have been modified according to consumers’ demands and also improvement in resistance to diseases (sharka, monilinia etc.), frost damages, and determination of self-(in) compatibility. in this study, fourteen apricot breed...

This document proposes an experiment to increase the permitted TCP initial window (IW) from between 2 and 4 segments, as specified in RFC 3390, to 10 segments with a fallback to the existing recommendation when performance issues are detected. It discusses the motivation behind the increase, the advantages and disadvantages of the higher initial window, and presents results from several large-s...

This document proposes an experiment to increase the permitted TCP initial window (IW) from between 2 and 4 segments, as specified in RFC 3390, to 10 segments with a fallback to the existing recommendation when performance issues are detected. It discusses the motivation behind the increase, the advantages and disadvantages of the higher initial window, and presents results from several large-s...

Staphylococcus gallinarum DSM 20610(T) is a rare pathogen in humans. The increasing relevance of human health prompted us to determine the genomic sequence of S. gallinarum. The complete genome sequence of S. gallinarum includes a genome of 3,171,720 bp (33.02% G+C content) without any plasmids.