Combinatorial Pattern Matching

DOI10.1007/B98377zbMATH Open1103.68982MaRDI QIDQ5315360FDOQ5315360

Authors: Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang 

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Finding biclusters by random projections
• Analysis of biclusters with applications to gene expression data
• Finding Additive Biclusters with Random Background
• Approximation Algorithms for Biclustering Problems
• Random walk biclustering for microarray data

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cited In (8)

• Analysis of biclusters with applications to gene expression data
• Finding biclusters by random projections
• An approximation ratio for biclustering
• On finding large conjunctive clusters.
• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
• Random walk biclustering for microarray data
• Nondeterministic communication complexity of random Boolean functions (extended abstract)
• Finding Additive Biclusters with Random Background

This page was built for publication: Combinatorial Pattern Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315360)