Bielefeld Pub
metadata only
Optimal alignments of longest common subsequences and their path properties
Lember J, Matzinger H, Vollmer A-L. Optimal alignments of longest common subsequences and their path properties. Bernoulli. 2014;20(3):1292-1343.
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#1062490
- A Configurable Heuristic for the MLCS Problem#1043065
- Optimal probe length varies for targets with high sequence variation: implications for probe library design for resequencing highly variable genes#824248
- A critical review of concepts and methods used in classical genome analysis#484884
- Read-Consistent Minimum Unique Substrings: A Parameter-Free, Linear-Time Framework for Genomic Sequence Representation#303417
Record · ID 1136668
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