Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

On infinite prefix normal words

Theoretical Computer Science(2021)10.1016/j.tcs.2021.01.015Source: DataRank Database

On infinite prefix normal words is a research paper published in Theoretical Computer Science (2021). On theSindex it has a DataRank of 0. It has been cited 3 times.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access3 citations

Download PDF

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (4 grants)Impact (FWCI 0.13)OA: greenTopics (36)IDs (PubMed, OpenAlex)

FAIR Checklist

Context only (not used in score)

Findable (1/2)

Has DOI

Accessible (1/2)

Open Access

Interoperable (0/2)

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (3)

Zsuzsanna Lipták ORCID,Massimiliano Rossi ORCID,Ferdinando Cicalese ORCID

Live enrichment

PubMed:34163096 OpenAlex:https://openalex.org/W2901727845

National Institutes of Health

Grant: HG011392

Division of Information and Intelligent Systems

Grant: 1618814

Israel Institute for Biological Research

Grant: 2029552

IIBR Informatics: An Efficient Pangenomics Graph Aligner

National Institutes of Health

Grant: 2R01HG011392-06

Personal and panel references for improved alignment

FWCI

0.13

Citation Percentile

0.4%

Citation Trend

2021

2025

greenLicense: Springer TDM

repositoryhttps://arxiv.org/pdf/1811.06273

publisherhttps://api.elsevier.com/content/article/PII:S0304397521000268?httpAccept=text/xml

publisherhttps://api.elsevier.com/content/article/PII:S0304397521000268?httpAccept=text/plain

repositoryhttp://arxiv.org/abs/1811.06273

Fields of Study

semigroups and automata theoryAlgorithms and Data CompressionNatural Language Processing Techniques02 engineering and technology0102 computer and information sciences01 natural sciences0202 electrical engineering, electronic engineering, information engineering

Keywords

PrefixLexicographical orderMathematicsPrefix codeNormalityBinary numberCombinatoricsOrder (exchange)Discrete mathematicsArithmeticAlgorithmLinguisticsStatisticsDecoding methodspaperfolding wordFOS: Computer and information sciencesCombinatorics on wordsFormal Languages and Automata Theory (cs.FL)prefix normal wordCombinatorics on words, Prefix normal words, Infinite words, Sturmian words, Abelian complexity, Paperfolding word, Thue-Morse sequence, Lexicographic orderSturmian wordComputer Science - Formal Languages and Automata Theorylexicographic orderThue-Morse wordabelian complexityFOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)Combinatorics on words Prefix normal words, Infinite words, Sturmian words, Abelian complexity, Paperfolding word, Thue-Morse sequence, Lexicographic order