Efficient minimizer orders for large values of <i>k</i> using minimum decycling sets

Research article (Genome Research, 2023) · cited 19× · AI/ML

academia openalex:W4385708519

Press Enter · cited answer in seconds

Efficient minimizer orders for large values of k using minimum decycling sets

Summary

Efficient minimizer orders for large values of k using minimum decycling sets is a scholarly article^[1].

Key Facts

Efficient minimizer orders for large values of k using minimum decycling sets's instance of is recorded as scholarly article^[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ Efficient minimizer orders for large values of k using minimum decycling sets — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Efficient minimizer orders for large values of k using minimum decycling sets is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). Efficient minimizer orders for large values of <i>k</i> using minimum decycling sets. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets

MLA

“Efficient minimizer orders for large values of <i>k</i> using minimum decycling sets.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets.

BibTeX

@misc{4ortxyz_efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient minimizer orders for large values of <i>k</i> using minimum decycling sets}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient minimizer orders for large values of <i>k</i> using minimum decycling sets — https://4ort.xyz/entity/efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/efficient-minimizer-orders-for-large-values-of-i-k-i-using-minimum-decycling-sets · Last refreshed: May 24, 2026