Sciweavers

116 search results - page 16 / 24
» Suballowable sequences of permutations
Sort
View
ICA
2007
Springer
14 years 1 months ago
Pivot Selection Strategies in Jacobi Joint Block-Diagonalization
A common problem in independent component analysis after prewhitening is to optimize some contrast on the orthogonal or unitary group. A popular approach is to optimize the contras...
Cédric Févotte, Fabian J. Theis
IFIP
2004
Springer
14 years 1 months ago
Imperfectness of Data for STS-Based Physical Mapping
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
CPM
2001
Springer
72views Combinatorics» more  CPM 2001»
14 years 3 days ago
Tandem Cyclic Alignment
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
Gary Benson