Sciweavers

2597 search results - page 23 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
CPC
2010
81views more  CPC 2010»
13 years 7 months ago
The Linus Sequence
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
Paul Balister, Steve Kalikow, Amites Sarkar
MBEC
2011
101views more  MBEC 2011»
12 years 10 months ago
Spatio-temporal alignment of pedobarographic image sequences
er of words of the abstract: 237 The number of figures: 4 The number of tables: 1
Francisco P. M. Oliveira, Andreia Sousa, Rubim San...
BMCBI
2011
12 years 11 months ago
Detection of recurrent rearrangement breakpoints from copy number data
Background: Copy number variants (CNVs), including deletions, amplifications, and other rearrangements, are common in human and cancer genomes. Copy number data from array compara...
Anna M. Ritz, Pamela L. Paris, Michael Ittmann, Co...
BMCBI
2007
180views more  BMCBI 2007»
13 years 7 months ago
Using expression arrays for copy number detection: an example from E. coli
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...
Dmitriy Skvortsov, Diana Abdueva, Michael E. Stitz...
ENDM
2008
59views more  ENDM 2008»
13 years 7 months ago
Unexpected behaviour of crossing sequences
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
Matt DeVos, Bojan Mohar, Robert Sámal