An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
- DOI
- 10.1109/tcbb.2020.2968531
- Published
- 2021 Jan-Feb
- Container
- IEEE/ACM transactions on computational biology and bioinformatics
- Publisher
- Not recorded
- Open access
- unknown
Credibility signals
limited evidence Score 43/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.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- 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.1109/tcbb.2020.2968531,
title = {An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.},
author = {Allen DR and Thankachan SV and Xu B},
year = {2021},
journal = {IEEE/ACM transactions on computational biology and bioinformatics},
doi = {10.1109/tcbb.2020.2968531},
url = {https://doi.org/10.1109/tcbb.2020.2968531}
}RIS
TY - JOUR TI - An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings. AU - Allen DR AU - Thankachan SV AU - Xu B PY - 2021 JO - IEEE/ACM transactions on computational biology and bioinformatics DO - 10.1109/tcbb.2020.2968531 UR - https://doi.org/10.1109/tcbb.2020.2968531 ER -
APA
DR, A., SV, T., & B, X. (2021). An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.. IEEE/ACM transactions on computational biology and bioinformatics. https://doi.org/10.1109/tcbb.2020.2968531
Source records
- pubmed · retrieved 2026-11-10T10:14:19.734Z