Merging String Sequences by Longest Common Prefixes

IPSJ Digital Courier
doi 10.2197/ipsjdc.4.69
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Information Processing Society of Japan

Related search

Longest Common Factor of Two Words

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Acceleration of Sequence Clustering Using Longest Common Subsequence Filtering

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

Performance on Patterned String Problems by Common Marmosets (Callithrix Jacchus)

Animal Cognition
EvolutionEcologyCognitive PsychologySystematicsBehaviorExperimental
2012English

Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

2020English

Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2017English

A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem

Frontiers in Genetics
GeneticsMolecular Medicine
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy