Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Computer Science > Data Structures and Algorithms

arXiv:1307.7842 (cs)
[Submitted on 30 Jul 2013]

Title:A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications

Authors:Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
View a PDF of the paper titled A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications, by Laurent Bulteau and 3 other authors
View PDF HTML (experimental)
Abstract:Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced strings, so that some elements may not be covered by any block. We present an efficient fixed-parameter algorithm for the parameters number k of blocks and maximum occurrence d of a letter in either string. We then evaluate this algorithm on bacteria genomes and synthetic data.
Comments: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013)
Subjects: Data Structures and Algorithms (cs.DS); Computational Engineering, Finance, and Science (cs.CE); Quantitative Methods (q-bio.QM)
Cite as: arXiv:1307.7842 [cs.DS]
  (or arXiv:1307.7842v1 [cs.DS] for this version)
  https://doi.org/10.48550/arXiv.1307.7842
arXiv-issued DOI via DataCite

Submission history

From: Aaron Darling [view email]
[v1] Tue, 30 Jul 2013 06:59:15 UTC (48 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications, by Laurent Bulteau and 3 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Additional Features

  • Audio Summary

Current browse context:

cs.DS
< prev   |   next >
new | recent | 2013-07
Change to browse by:
cs
cs.CE
q-bio
q-bio.QM

References & Citations

  • SciX
  • Google Scholar
  • Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Laurent Bulteau
Guillaume Fertin
Christian Komusiewicz
Irena Rusu
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)