Sciweavers

249 search results - page 14 / 50
» Finding Patterns in Given Intervals
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Longest Common Pattern between two Permutations
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
Dominique Rossin, Mathilde Bouvel
BMCBI
2006
157views more  BMCBI 2006»
13 years 8 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik
JUCS
2002
163views more  JUCS 2002»
13 years 8 months ago
Finding Plagiarisms among a Set of Programs with JPlag
: JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java ...
Lutz Prechelt, Guido Malpohl, Michael Philippsen
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 12 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...