Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Automatic ontology matching using application semantics
AI Magazine - Special issue on semantic integration
Information Processing Letters
Improved algorithmms for the k maximum-sums problems
Theoretical Computer Science
Fast algorithms for finding disjoint subsequences with extremal densities
Pattern Recognition
Theoretical Computer Science
On the range maximum-sum segment query problem
Discrete Applied Mathematics
Optimal algorithms for the average-constrained maximum-sum segment problem
Information Processing Letters
Extracting article text from the web with maximum subsequence segmentation
Proceedings of the 18th international conference on World wide web
On burstiness-aware search for document sequences
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Web article extraction for web printing: a DOM+visual based approach
Proceedings of the 9th ACM symposium on Document engineering
Constructing comprehensive summaries of large event sequences
ACM Transactions on Knowledge Discovery from Data (TKDD)
Assessing the Discordance of Multiple Sequence Alignments
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Information Processing Letters
SimShiftDB: chemical-shift-based homology modeling
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithm for K disjoint maximum subarrays
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Computing maximum-scoring segments in almost linear time
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Fast algorithms for finding disjoint subsequences with extremal densities
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved algorithms for the k maximum-sums problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A parallel algorithm for finding all successive minimal maximum subsequences
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
SigSpot: mining significant anomalous regions from time-evolving networks (abstract only)
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the spatiotemporal burstiness of terms
Proceedings of the VLDB Endowment
Generating event storylines from microblogs
Proceedings of the 21st ACM international conference on Information and knowledge management
Automatic Extraction of Blog Post from Diverse Blog Pages
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Trends in computer science research
Communications of the ACM
Journal of Discrete Algorithms
Hybrid pseudo-relevance feedback for microblog retrieval
Journal of Information Science
| Hi-index | 0.03 |