A Branch Elimination-based Efficient Algorithm for Large-scale Multiple Longest Common Subsequence Problem

Keyphrases

• Directed Acyclic Graph 100%
• Point Matching 100%
• Longest Common Subsequence Problem 100%
• Estimation Scheme 100%
• Multiple Longest Common Subsequences 100%
• Elimination Method 50%
• Pattern Recognition 50%
• Existing Algorithms 50%
• DNA Sequencing 50%
• High Complexity 50%
• Computational Biology 50%
• Three-state 50%
• Construction Method 50%
• Time Consumption 50%
• Information Retrieval 50%
• Memory Consumption 50%
• Pattern Information 50%
• Graph Construction 50%
• Longest Path 50%
• Current Match 50%
• Multiple Sequences 50%
• Time-efficient Algorithms 50%
• Longest Common Subsequence 50%
• Space-efficient Algorithms 50%
• Finite alphabet 50%

Computer Science

• Efficient Algorithm 100%
• Directed Acyclic Graph 100%
• Estimation Scheme 100%
• Pattern Recognition 50%
• Information Retrieval 50%
• Time Consumption 50%
• Memory Consumption 50%
• Graph Construction 50%
• Longest Path 50%

Mathematics

• Subsequence 100%
• Directed Acyclic Graph 100%
• Pattern Recognition 50%
• Upper Bound 50%
• Longest Path 50%