Sciweavers

557 search results - page 50 / 112
» dna 2007
Sort
View
ICFP
2008
ACM
14 years 8 months ago
Report on the tenth ICFP programming contest
The Tenth Annual ICFP Programming Contest was a 72-hour contest held July 20?23 2007 and organised in conjunction with the 12th ACM SIGPLAN International Conference on Functional ...
Alexey Rodriguez, Andres Löh, Arie Middelkoop...
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 15 days ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
SDM
2007
SIAM
195views Data Mining» more  SDM 2007»
13 years 10 months ago
On Anonymization of String Data
String data is especially important in the privacy preserving data mining domain because most DNA and biological data is coded as strings. In this paper, we will discuss a new met...
Charu C. Aggarwal, Philip S. Yu
BMCBI
2005
104views more  BMCBI 2005»
13 years 8 months ago
A statistical approach for array CGH data analysis
Background: Microarray-CGH experiments are used to detect and map chromosomal imbalances, by hybridizing targets of genomic DNA from a test and a reference sample to sequences imm...
Franck Picard, Stéphane Robin, Marc Laviell...
DAM
2007
91views more  DAM 2007»
13 years 8 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...