Skip to content
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Search
Contents
Abstract
References
Journal of Combinatorial Mathematics and Combinatorial Computing
Volume 115
Pages: 111-125
Research article
A recursive exact algorithm for the closest string problem
Omar Latorre Vilca
,
Mario jun. Salvatierra
Download PDF
Cite
Copyright Link
License
Citation
Omar Latorre Vilca, Mario jun. Salvatierra. A recursive exact algorithm for the closest string problem[J],
Journal of Combinatorial Mathematics and Combinatorial Computing
, Volume 115. 111-125. .