Sciweavers

1732 search results - page 58 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
EJC
2010
15 years 6 months ago
Descent polynomials for permutations with bounded drop size
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
Fan R. K. Chung, Anders Claesson, Mark Dukes, Rona...
BMCBI
2008
149views more  BMCBI 2008»
15 years 6 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
Olivier Bastien, Eric Maréchal
NAR
1998
55views more  NAR 1998»
15 years 5 months ago
The orientation and dynamics of the C2'-OH and hydration of RNA and DNA.RNA hybrids
The stereochemical and dynamic properties of the C2′ hydroxyl group in several DNA·RNA hybrids have been measured by NMR and compared with the homologous RNA duplex. The C2′-...
Jeffrey I. Gyi, Andrew N. Lane, Graeme L. Conn, To...
SODA
2010
ACM
278views Algorithms» more  SODA 2010»
16 years 3 months ago
The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
Ken-ichi Kawarabayashi, Yusuke Kobayashi
CGO
2008
IEEE
16 years 20 days ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout