Fast computation of a string duplication history under no-breakpoint-reuse.
- DOI
- 10.1098/rsta.2013.0133
- Published
- 2014 May 28
- Container
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1098/rsta.2013.0133,
title = {Fast computation of a string duplication history under no-breakpoint-reuse.},
author = {Brejová B and Kravec M and Landau GM and Vinař T},
year = {2014},
journal = {Philosophical transactions. Series A, Mathematical, physical, and engineering sciences},
doi = {10.1098/rsta.2013.0133},
url = {https://doi.org/10.1098/rsta.2013.0133}
}RIS
TY - JOUR TI - Fast computation of a string duplication history under no-breakpoint-reuse. AU - Brejová B AU - Kravec M AU - Landau GM AU - Vinař T PY - 2014 JO - Philosophical transactions. Series A, Mathematical, physical, and engineering sciences DO - 10.1098/rsta.2013.0133 UR - https://doi.org/10.1098/rsta.2013.0133 ER -
APA
B, B., M, K., GM, L., & T, V. (2014). Fast computation of a string duplication history under no-breakpoint-reuse.. Philosophical transactions. Series A, Mathematical, physical, and engineering sciences. https://doi.org/10.1098/rsta.2013.0133
Source records
- pubmed · retrieved 2026-09-25T02:49:49.698Z
- europe-pmc · retrieved 2026-09-25T02:49:49.740Z