arXiv (All)
open access
A Configurable Heuristic for the MLCS Problem
Motivation: The Multiple Longest Common Subsequence (MLCS) problem for an arbitrary number of sequences is an NP-hard problem in sequence analysis. Existing exact algorithms based on dynamic programming or MLCS-DAG pruning rapidly exhaust memory as sequence lengths and set sizes grow, while heuristi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Configurable Heuristic for the MLCS Problem#1043065
- Engineering and optimization of systems, methods and compositions for sequence … — The Broad Institute, Inc. (US20250250577A1)#607205
- Optimal probe length varies for targets with high sequence variation: implications for probe library design for resequencing highly variable genes#824248
- Optimal alignments of longest common subsequences and their path properties#1136668
- SeqMaestro: From nucleotide sequences to biological hypotheses through interpretable machine learning#1084794
Record · ID 1062490
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive