Result 1 to 20 of 28 total
Fixing multiple eigenvalues by a minimal perturbation. (English)
Linear Algebra Appl. 432, No. 7, 1785-1817 (2010).
1
Improved twiddle access for fast Fourier transforms (English)
IEEE Transactions on Signal Processing 58, No. 3, 1122-1130 (2010).
2
Value regularization and Fenchel duality. (English)
J. Mach. Learn. Res. 8, 441-479 (2007).
3
Infinite-$σ$ limits for Tikhonov regularization. (English)
J. Mach. Learn. Res. 7, 855-876 (2006).
4
Discrete approximations to continuum optimal flow problems. (English)
Stud. Appl. Math. 117, No. 4, 321-333 (2006).
5
Finding anchors for genomic sequence comparison (English)
Journal of Computational Biology 12, No. 6, 762-776 (2005).
6
A space-efficient construction of the Burrows-Wheeler transform for genomic data (English)
Journal of Computational Biology 12, No. 7, 943-951 (2005).
7
Space-efficient whole genome comparisons with burrowswheeler transforms (English)
Journal of Computational Biology 12, No. 4, 407-415 (2005).
8
Asymptotics of Gaussian regularized least squares (English)
NIPS (2005).
9
Syntenic layout of two assemblies of related genomes. (English)
Giegerich, Robert et al., German conference on bioinformatics 2004, GCB 2004, October 4-6, 2004, Bielefeld, Germany. Bonner Köllen Verlag (ISBN 3-88579-382-2). GI-Edition - Lecture Notes in Informatics (LNI), P-53, 3-12 (2004).
10
A survey of computational methods for determining haplotypes. (English)
Istrail, Sorin (ed.) et al., Computational methods for SNPs and haplotype inference. DIMACS/RECOMB satellite workshop, Piscataway, NJ, USA, November 21‒22, 2002. Revised papers. Berlin: Springer (ISBN 3-540-21249-3/pbk). Lecture Notes in Computer Science 2983. Lecture Notes in Bioinformatics, 26-47 (2004).
11
Sequence database compression for peptide identification from tandem mass spectra (English)
WABI, 230-241 (2004).
12
Syntenic layout of two assemblies of related genomes (English)
German Conference on Bioinformatics, 3-12 (2004).
13
Finding anchors for genomic sequence comparison (English)
RECOMB, 233-241 (2004).
14
Combinatorial problems arising in SNP and haplotype analysis. (English)
Calude, Cristian S. (ed.) et al., Discrete mathematics and theoretical computer science. 4th international conference, DMTCS 2003, Dijon, France, July 7‒12, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40505-4/pbk). Lect. Notes Comput. Sci. 2731, 26-47 (2003).
15
Combinatorial problems arising in SNP and haplotype analysis (English)
DMTCS, 26-47 (2003).
16
Distributional regimes for the number of $k$-word matches between two random sequences. (English)
Proc. Natl. Acad. Sci. USA 99, No. 22, 13980-13989 (2002).
17
Generating peptide candidates from amino-acid sequence databases for protein identification via mass spectrometry. (English)
Guigó, Roderic (ed.) et al., Algorithms in bioinformatics. Second international workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2452, 68-81 (2002).
18
The multimode Procrustes problem. (English)
Linear Algebra Appl. 349, No.1-3, 245-264 (2002).
19
Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem (English)
Briefings in Bioinformatics 3, No. 1, 23-31 (2002).
20
Result 1 to 20 of 28 total
Start
Contact
Print
General Help
