The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Selected combinatorial research problems.
Selected combinatorial research problems.
Longest common subsequences of two random sequences.
Longest common subsequences of two random sequences.
Parallel parsing on a one-way array of finite-state machines
IEEE Transactions on Computers
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Scheduling high-level blocks for functional simulation
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
Approximating the longest approximate common subsequence problem
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
Collaborative document monitoring
GROUP '01 Proceedings of the 2001 International ACM SIGGROUP Conference on Supporting Group Work
ChangeDetector: a site-level monitoring tool for the WWW
Proceedings of the 11th international conference on World Wide Web
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
An Approach to Designing Very Fast Approximate String Matching Algorithms
IEEE Transactions on Knowledge and Data Engineering
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
A new flexible algorithm for the longest common subsequence problem
Nordic Journal of Computing
Approximation algorithms for the shortest common supersequence
Nordic Journal of Computing
Detecting and Representing Relevant Web Deltas in WHOWEDA
IEEE Transactions on Knowledge and Data Engineering
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Computation of All Longest Common Subsequences
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Preferred Document Classification for a Highly Inflectional/Derivational Language
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Internet Difference Engine and Its Applications
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms
Fundamenta Informaticae - Special issue on computing patterns in strings
The constrained longest common subsequence problem
Information Processing Letters
Journal of Algorithms
Sparse LCS common substring alignment
Information Processing Letters
Languages of analogical strings
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
A learning algorithm for the longest common subsequence problem
Journal of Experimental Algorithmics (JEA)
Information Processing Letters
A simple algorithm for the constrained sequence problems
Information Processing Letters
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Classification and clustering for case-based criminal summary judgments
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
Scaled and permuted string matching
Information Processing Letters
Parallel Strategies for Local Biological Sequence Alignment in a Cluster of Workstations
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
CX-DIFF: a change detection algorithm for XML content and change visualization for WebVigiL
Data & Knowledge Engineering - Special issue: XML schema and data management
An almost-linear time and linear space algorithm for the longest common subsequence problem
Information Processing Letters
Analysis of signature change patterns
MSR '05 Proceedings of the 2005 international workshop on Mining software repositories
Cache-oblivious dynamic programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On-line automated performance diagnosis on thousands of processes
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
MAPO: mining API usages from open source repositories
Proceedings of the 2006 international workshop on Mining software repositories
A dataflow approach to efficient change detection of HTML/XML documents in WebVigiL
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Parallel strategies for the local biological sequence alignment in a cluster of workstations
Journal of Parallel and Distributed Computing
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
A bio-inspired approach for multi-word expression extraction
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Two algorithms for LCS Consecutive Suffix Alignment
Journal of Computer and System Sciences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Regular expression constrained sequence alignment
Journal of Discrete Algorithms
LCS-TRIM: dynamic programming meets XML indexing and querying
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Information Sciences: an International Journal
PHALANX: a graph-theoretic framework for test case prioritization
Proceedings of the 2008 ACM symposium on Applied computing
Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Computers and Operations Research
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science
S2S: structural-to-syntactic matching similar documents
Knowledge and Information Systems
A New Efficient Algorithm for Computing the Longest Common Subsequence
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Constrained LCS: Hardness and Approximation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Information Processing Letters
Automatic Extraction of Process Control Flow from I/O Operations
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Symbolic analysis of indicator time series by quantitative sequence alignment
Computational Statistics & Data Analysis
Algorithms for subsequence combinatorics
Theoretical Computer Science
Expert Systems with Applications: An International Journal
Improved bounds on the average length of longest common subsequences
Journal of the ACM (JACM)
IEICE - Transactions on Information and Systems
Network analysis of collaboration structure in Wikipedia
Proceedings of the 18th international conference on World wide web
Similarity measures for trajectory of moving objects in cellular space
Proceedings of the 2009 ACM symposium on Applied Computing
Neighbourhood Counting Metric for Sequences
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
LCS Approximation via Embedding into Local Non-repetitive Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Sparse RNA Folding: Time and Space Efficient Algorithms
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Fast algorithms for computing tree LCS
Theoretical Computer Science
A model for perception of structural image feature
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Temporal feature modulation for video watermarking
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Heuristic Reusable Dynamic Programming: Efficient Updates of Local Sequence Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Neighborhood counting for financial time series forecasting
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An almost-linear time and linear space algorithm for the longest common subsequence problem
Information Processing Letters
Scaled and permuted string matching
Information Processing Letters
Efficient algorithms for the block edit problems
Information and Computation
Sparse LCS common substring alignment
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
WebVigiL: user profile-based change detection for HTML/XML documents
BNCOD'03 Proceedings of the 20th British national conference on Databases
Probabilistic context prediction using time-inferred multiple pattern networks
Proceedings of the 2010 ACM Symposium on Applied Computing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Finding common structured patterns in linear graphs
Theoretical Computer Science
A time weighted neighbourhood counting similarity for time series analysis
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
WebPUM: A Web-based recommendation system to predict user future movements
Expert Systems with Applications: An International Journal
A simple and efficient approach to barcode localization
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
An IR-Aided Machine Learning Framework for the BioCreative II.5 Challenge
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Clustering of vehicle trajectories
IEEE Transactions on Intelligent Transportation Systems
Algorithms and theory of computation handbook
Finding Patterns In Given Intervals
Fundamenta Informaticae
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Sparse RNA folding: Time and space efficient algorithms
Journal of Discrete Algorithms
LCS approximation via embedding into locally non-repetitive strings
Information and Computation
AskHERMES: An online question answering system for complex clinical questions
Journal of Biomedical Informatics
Information Sciences: an International Journal
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization
Omnify: investigating the visibility and effectiveness of copyright monitors
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
Parallel sequence alignment: a lookahead approach
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Journal of Heuristics
Parallel smith-waterman algorithm for local DNA comparison in a cluster of workstations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
SA-REPC: sequence alignment with regular expression path constraint
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Restricted transposition invariant approximate string matching under edit distance
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Utilizing dynamically updated estimates in solving the longest common subsequence problem
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Normalized similarity of RNA sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Trace-Based memory aliasing across program versions
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Fast algorithms for computing the constrained LCS of run-length encoded strings
Theoretical Computer Science
An empirical study of recognizing textual entailment in Japanese text
CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Algorithms for the bounded set-up knapsack problem
Discrete Optimization
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Finding translations in scanned book collections
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Fundamenta Informaticae - Computing Patterns in Strings
ACM Transactions on Asian Language Information Processing (TALIP) - Special Issue on RITE
Soft cardinality: a parameterized similarity function for text comparison
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
UMCC-DLSI: multidimensional lexical-semantic textual similarity
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Soft cardinality + ML: learning adaptive similarity functions for cross-lingual textual entailment
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Common structured patterns in linear graphs: approximation and combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Algorithms for computing the longest parameterized common subsequence
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Left-Right oscillate algorithm for community detection used in e-learning system
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
Utilizing query change for session search
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
On supernode transformations and multithreading for the longest common subsequence problem
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
Tuning research tools for scalability and performance: The NiCad experience
Science of Computer Programming
Fast Longest Common Subsequence with General Integer Scoring Support on GPUs
Proceedings of Programming Models and Applications on Multicores and Manycores
A Case Study of Implementing Supernode Transformations
International Journal of Parallel Programming
| Hi-index | 0.02 |