Sciweavers

34 search results - page 5 / 7
» cpm 2007
Sort
View
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 4 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
14 years 1 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
14 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 4 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
GLOBECOM
2007
IEEE
14 years 4 months ago
Reduced Complexity Sequence Detection of Continuous Phase Modulation Represented as the Linear Superposition of Amplitude Modula
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
Marilynn P. Wylie-Green, Erik Perrins