نتایج جستجو برای: s increasing sequence

تعداد نتایج: 1525121  

1Mohammad Reza Zali 1Mohammad Taghi Salehian Anahita Dezfulian Hossein Dabiri, Mahvash Oskoui Masumeh Azimirad Mohammad Mehdi Aslani, Parisa Farrokh

Objective(s) Staphylococcus aureus is a common cause of human infection, and emergence of vancomycin-resistance S. aureus  is a great concern for treatment of methicillin-resistant S. aureus,(MRSA) in recent years (MRSA). Here, we report the isolation of high-level VRSA. Materials and Methods S. aureus was isolated from foot ulcer of a diabetic woman in Tehran, Iran. Antibiotic susceptibilit...

1995
Jean-Dominique Deuschel

We consider the concentration of measure for n iid, two-dimensional random variables, under the conditioning that they form a record. Under mild conditions, we show that all random variables tend to concentrate, as n ! 1, around limiting curves, which are the solutions of an appropriate variational problem. We also show that the same phenomenum occurs, without the records conditioning, for the ...

Journal: :Computing and Informatics 2012
Sebastian Deorowicz

A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on c...

Journal: :Electr. J. Comb. 2007
Piotr Sniady

ABSTRACT. We study the shape of the Young diagram λ associated via the Robinson–Schensted– Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other words we study the restriction of the Plancherel measure to Young diagrams with at most d rows. We prove that in the limit n → ∞ the rows of λ behave like ...

Journal: :Theor. Comput. Sci. 2005
Erdong Chen Hao Yuan Linji Yang

Given a sequence π1π2 . . . πn, a longest increasing subsequence (LIS) in a window π〈l, r〉= πlπl+1 . . . πr is a longest subsequence σ = πi1πi2 . . . πiT such that l ≤ i1 < i2 < · · · < iT ≤ r and πi1 < πi2 < · · · < πiT . We consider the Lisw problem, which is to find the longest increasing subsequences in a sliding window of fixed-size w over a sequence. Formally, it is to find a LIS for ever...

Journal: :iranian journal of basic medical sciences 0
anahita dezfulian research centre of gastroenterology and liver diseases (rcgld) in shahid beheshti university, tehran, iran mohammad mehdi aslani department of microbiology, institute pasteur of iran, tehran, iran mahvash oskoui department of microbiology, institute pasteur of iran, tehran, iran parisa farrokh department of microbiology, institute pasteur of iran, tehran, iran masumeh azimirad research centre of gastroenterology and liver diseases (rcgld) in shahid beheshti university, tehran, iran hossein dabiri research centre of gastroenterology and liver diseases (rcgld) in shahid beheshti university, tehran, iran

objective(s) staphylococcus aureus is a common cause of human infection, and emergence of vancomycin-resistance s. aureus  is a great concern for treatment of methicillin-resistant s. aureus,(mrsa) in recent years (mrsa). here, we report the isolation of high-level vrsa. materials and methods s. aureus was isolated from foot ulcer of a diabetic woman in tehran, iran. antibiotic susceptibility w...

2007
Victor Bronstein

This note can be viewed as a logical continuation of our previous Note published earlier in the Monthly 1]. We shall repeat here, brieey, its main results to make the reading easier. A counting sequence S is a sequence of sequences fS i g 1 i=0 of positive integers. The sequence S i+1 is obtained from S i by counting the number m k of times an integer k occurs in S i and writing down in S i+1 t...

Journal: :Monthly Notices of the Royal Astronomical Society 1987

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید