ReadsMap: a new tool for high precision mapping of DNAseq and RNAseq read sequences

2); Igor Seledtsov (1); Jaroslav Efremov ( 1; Victor Solovyev (1); Vladimir Molodtsov (1 and2)

REVIEW 6 major objections 4 minor 2 references

ReadsMap: a new tool for high precision mapping of DNAseq and RNAseq read sequences

T0 review · 6 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read ReadsMap, a hash-based aligner, maps spliced reads across introns with over 99% sensitivity, outperforming BWT-based mappers in head-to-head tests.

desk verdict The paper's two-pass intron-rebuilding idea is real and not in the compared tools, but the empirical case for superior accuracy rests on a simulation that is tailor-made for that mechanism and on a suspect STAR baseline. read the letter →

arxiv 1908.01445 v1 pith:XUWSNVFH submitted 2019-08-05 q-bio.GN

Igor Seledtsov (1) , Jaroslav Efremov ( 1 , 2) , Vladimir Molodtsov (1 and2) , Victor Solovyev (1) This is my paper · ORCID

classification q-bio.GN

keywords readmappingRNA-seqsplicedreadsintronpredictionhash-basedalignmentalternativesplicingDNA-seqshort

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

ReadsMap is a read-mapping program built on hashing the reference genome rather than on the Burrows-Wheeler Transform. The paper argues that this choice pays off where BWT-based mappers struggle: reads that carry many mismatches or SNPs, and RNA-seq reads that span introns. On simulated human chromosome 22 data, ReadsMap aligns more than 99.8% of non-spliced reads and more than 99.4% of spliced reads correctly, with higher F1 and G-measure scores than TopHat, STAR, and PASS on spliced reads. The practical payoff is precise intron positions, which directly supports gene-structure prediction and the identification of alternatively spliced isoforms.

What carries the argument

The machinery is a two-stage alignment search. First, the genome is hashed and the read is scanned for alignment nuclei, which are regions of high similarity found by clustering k-mer matches (default k=12, at least 7 hits) along diagonals. Each nucleus is extended into an intronless alignment; if unaligned flanks are long enough, nearby splice sites are sought and a multi-block alignment is built subject to the genome's intron-length limits, from the minimum intron length to the 99th percentile of the intron-length distribution. The block boundaries are then optimized using splice-site weights and mismatch counts. In a second pass, short unaligned flanks that are too short to place alone are transferred to adjacent exons when other reads support an intron at that position, down to 1 bp, letting the program reconstruct introns that single-read alignment alone could not establish.

What would settle it

Take a genome with known introns, generate simulated reads whose introns are deliberately longer than the 99th-percentile bound the program assumes, and check whether ReadsMap fails to align those spliced reads; if it does, the intron-length window is the binding constraint.

Watch

Extended reading notes

Core claim

The central claim is that a hash-based aligner can achieve higher accuracy than BWT-based aligners in the difficult cases: mapping short read fragments separated by long introns, and mapping reads with high error or SNP loads. ReadsMap's accuracy on spliced reads is reported above 99.4% sensitivity and above 95% specificity for 50-100 bp reads, and its spliced-read F1 and G-measures exceed those of TopHat, STAR, and PASS in the authors' tests. For DNA-seq reads with up to 10% mismatches, ReadsMap's sensitivity declines more slowly than BWA's or Bowtie's, though it is slower and less specific on clean data. The authors single out the accurate placement of very short terminal read pieces separated by long introns as the main source of the advantage, achieved by using information from other reads that contain the same intron.

Load-bearing premise

The load-bearing premise is that the genome's intron-length distribution is known well enough to set the search window: the method only looks for introns between the genome's minimum intron length and the 99th percentile of its intron lengths, so if that distribution is wrong, atypical, or unavailable, spliced reads with valid introns outside the window will be missed even though the read sequences are correct.

Editorial extensions

If this is right

If the reported accuracy holds, RNA-seq reads can fix intron boundaries to single-base resolution, improving gene-structure prediction and isoform annotation.
Spliced-read mapping no longer depends on one read containing both exon flanks: a read with only a few bases on one side of an intron can be placed correctly when sibling reads support the intron.
For DNA-seq data, the method should tolerate higher SNP and error densities than BWT mappers, at the cost of more compute time, which matters for variant calling in divergent or error-rich samples.
The gap between hash-based and BWT-based accuracy on spliced reads suggests that the choice of indexing scheme, not just aligner details, limits spliced-read accuracy.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A testable consequence is that accuracy on rare isoforms should depend on coverage, because the intron-rebuilding step needs other reads containing the same intron; low coverage would leave short flanks unplaced.
The intron-length window could be estimated iteratively from the read data itself rather than from annotated intron distributions, which would remove the main genome-specific assumption and extend the method to unannotated genomes.
The same short-flank transfer principle might apply to non-splice gaps such as long insertions or structural variants, if splice-site scoring were replaced by generic boundary scoring.
Combining the hash-based index with a BWT prefilter might retain the accuracy while reducing the reported runtime disadvantage.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

You should know one thing before reading this: the core algorithmic idea is actually new. ReadsMap runs a first pass to get confident spliced alignments, compiles a list of introns, then uses those introns to rescue short unaligned flanks (down to 1 bp) on other reads by transferring them to an adjacent exon. That cross-read intron-rebuilding step is not in Bowtie, BWA, TopHat, STAR, or PASS. The authors describe it clearly, with figures that make the mechanism easy to follow. Credit where it is due: this is a plausible contribution to spliced-read mapping, and it is not a rehash of BWT-based methods. The paper also reports that ReadsMap stays more sensitive than BWA and Bowtie on DNA-seq reads with high mutation rates, though at a large compute cost, and it honestly notes that its optimization loses advantage when reads are longer than average exons.

The soft spots are concentrated in the benchmark, and they are not minor. The RNA-seq comparison is entirely simulated from 1,356 annotated chr22 mRNAs at 40x coverage. That is the ideal condition for ReadsMap's cross-read rescue: every true intron has many concordant supporting reads. Real RNA-seq has uneven coverage, low-abundance isoforms, and reads that may be the only support for a junction. On top of that, the paper's correctness rule explicitly prefers the spliced alignment in ambiguous alternative-isoform cases (Fig. 5), so the accuracy measure is biased toward the method's own behavior. The comparative numbers are also shaky. Tables 4 and 5 contain obvious transcription errors, no STAR command line is given, and STAR's spliced-only sensitivities (0.65–0.78 for 50–100 bp) are far below what a properly configured STAR should achieve. Table 7 is labeled 'spliced reads' but reports all-read Sn/Sp, which muddies the claimed advantage. There is no real-data validation, and no code or data are provided to check any of this.

The intron-length bound the reader flagged is a real limitation but secondary: ReadsMap only searches introns between a genome's minimum and 99th-percentile intron length, so an atypical genome would break it. The bigger issue is that the central claim—superior spliced-read mapping—is not yet convincing because the benchmark is structurally favorable and the baselines look misconfigured.

Who is this for? Someone working on spliced-alignment heuristics might get useful ideas from the two-pass mechanism. Someone looking for a validated read mapper should not rely on these results yet. I would send this to peer review rather than desk-reject: the algorithmic contribution is worth evaluating seriously, and a referee could push the authors to fix the tables, disclose STAR parameters, and add real RNA-seq benchmarks. I would not cite it in my own work until the evidence is cleaner.

Referee Report

6 major / 4 minor

Summary. The manuscript presents ReadsMap, a hash-based short-read aligner for DNA-seq and RNA-seq reads. The algorithm seeds alignments with k-mer 'nuclei,' extends intronless blocks, and then reconstructs introns across reads by transferring short unaligned flanks to adjacent exons using introns supported by other reads. The authors test ReadsMap on simulated human chromosome 22 reads (DNA-seq with 0.5-10% mutation rates and RNA-seq reads of 50/76/100 bp derived from 1,356 annotated mRNAs at 40x coverage) and compare it with TopHat, STAR, PASS, Bowtie, and BWA using sensitivity, specificity, F1, and G-measure. They report that ReadsMap has near-perfect accuracy for unspliced reads and superior accuracy for spliced reads relative to the compared tools, while also being more robust to high mutation rates than BWA and Bowtie, at the cost of higher runtime.

Significance. If the reported results held, ReadsMap would offer a useful alternative for spliced-read mapping, particularly for reconstructing intron positions and supporting gene-structure and alternative-isoform annotation. The paper contributes an actual implemented tool, and its core idea of using cross-read intron evidence to place very short exonic fragments is interesting. However, the empirical support is presently limited to a single simulated chromosome with high, uniform coverage, and the comparisons to other programs contain serious internal inconsistencies and missing parameter information. The claimed significance is therefore conditional on additional validation and reproducible benchmarking.

major comments (6)

[Testing performance of reads mapping (Tables 4-5, 7)] The benchmark uses only simulated reads from human chromosome 22 at 40x coverage generated from 1,356 annotated mRNAs. The cross-read intron-rebuilding step (Fig. 4) is the paper's distinctive mechanism, and 40x uniform coverage of every annotated transcript is the ideal condition for it: every true intron is supported by many concordant reads. Real RNA-seq data have uneven isoform abundances, variable coverage, and reads from unannotated or novel isoforms. No real-data validation, downsampling experiment, or coverage-robustness test is provided, so the central claim of superior spliced-read accuracy is not shown to generalize beyond this favorable simulation.
[Tables 4-5 and 7] The competitor comparisons are not reproducible and contain impossible numbers. No command line or parameter settings are given for STAR, whose reported spliced-read sensitivities (Table 5: Sn=0.65, 0.76, and 0.78 for 50, 76, and 100 bp reads) are far below what a properly configured STAR should achieve. In Table 4C, TopHat's 'Correct alignments' for unspliced reads (1,433,124) exceeds its '# Alignments' (982,077). In Table 5B, STAR's spliced '# Alignments' and 'Correct alignments' are both 369,229, yet Sp is reported as 0.73010, which is arithmetically impossible. These errors make the quantitative ranking in Table 7 unreliable and prevent readers from reproducing the comparison.
[Table 7] Table 7 is introduced as a summary of accuracy for spliced-read mapping, but the ReadsMap, TopHat, and STAR rows use the 'All' reads values from Tables 3-5, not spliced-read-only values. For example, ReadsMap's Table 7 entries (Sn=0.99737, Sp=0.95768 for 50 bp) match the 'All' row of Table 3A, not the spliced row. The conclusion that 'ReadsMap demonstrates superior results' for spliced reads is therefore not actually supported by the spliced-only measurements, and the table's heading is misleading.
[Recreating introns and selecting accurate spliced alignments (Fig. 5)] The mapping selection rule explicitly chooses the spliced variant when a read has equally good spliced and unspliced alignments ('we select the spliced variant if we consider just one mapping for a read'). Since the simulated benchmark's ground truth is a single transcript origin, reads from alternatively spliced isoforms can be counted as incorrect when ReadsMap outputs a different isoform's splice junction. The GAB4 example (Fig. 5) demonstrates this ambiguity. Because of this built-in preference, the reported 'correct spliced alignment' measure is not an unbiased accuracy statistic, and the paper's claim that ReadsMap helps resolve alternatively spliced isoforms is not directly tested by these data.
[Alignment of a single read (intron length bounds)] The algorithm restricts intron length to between the genome's minimum intron length and the 99th percentile of its intron-length distribution. This is a load-bearing design assumption: for a genome with an unknown, incorrect, or atypical intron-length distribution, valid spliced alignments will be systematically rejected regardless of read sequence quality. The manuscript neither tests sensitivity to these bounds nor validates the approach on genomes with different intron-length characteristics, so the generality of the spliced-alignment claims is not established.
[Alignment of a single read (parameters)] All key parameters are hand-set without a sensitivity analysis: k-mer length (k=12), minimum number of k-mer matches (7), minimum nucleus lengths (13/20/26 bp for 50/76/100 bp reads), homology thresholds, the 96% score-retention cutoff, and the intron length bounds. Because the benchmark read lengths match the read-length-dependent nucleus thresholds, the possibility that these parameters were tuned to this particular simulated dataset cannot be excluded. A parameter-robustness study or analysis on an independent dataset is needed to establish that the reported advantages are not artifacts of overfitting.

minor comments (4)

[Throughout] The text contains several typos and inconsistent spellings: 'RedsMap' in the testing section, 'unsplaced' for 'unspliced' in the alignment description, 'sequnces' in the Table 8 title, 'deferent' in the conclusion, and a Cyrillic 'о' in the Figure 3 caption ('An example оf'). These should be corrected.
[Tables 4-6] Table 6 is used twice: first for PASS mapping results and then for the longest-block accuracy results. The second table should be renumbered. Also, in Table 10 the decimal separator is sometimes a comma (e.g., '0,98880') while other tables use a period; this should be made consistent.
[References] Some reference callouts are inconsistent with the bibliography. The text cites [7,8] for PASS and for TopHat, but references [7] and [8] are the Bowtie and BWA papers, while PASS is cited as [5] (and [6] for PASS-bis). The citation list should be rechecked.
[Figure 5] The Figure 5 caption and the embedded labels are garbled: the caption refers to isoforms 'a and b' while the figure contains labels '2 1 b c d 3 3 3 3 3 4 4 a' interspersed with exon diagrams. The figure should be redrawn with clear isoform labels and panel references.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper's accuracy claims are empirical measurements against externally simulated ground truth, not derivations from fitted or self-referential inputs.

full rationale

ReadsMap is an empirical tool paper. Its central claims are benchmark accuracies for spliced and unspliced read mapping, compared with known simulated read locations in human chromosome 22 (the paper states: 'Results of reads mapping were compared with known reads locations in chromosome sequence'). These are measurements, not quantities derived from the model's own parameters, so there is no derivation chain that could reduce to its inputs. The heuristic parameters mentioned (k=12, minimum 7 k-mer matches, nucleus length/homology requirements such as 'minimum lengths are 13, 20 and 26 bp correspondingly with homology level of 91.5%') are algorithmic thresholds, and the paper does not claim to predict benchmark outcomes from them; no parameter is fitted to the test set and then reported as a prediction. The cross-read intron-rebuilding step (Fig. 4) and the rule to prefer spliced variants in ambiguous cases ('we select the spliced variant if we consider just one mapping for a read') affect the measured performance but are not circular: they are algorithmic choices evaluated against external ground truth. Self-citations [13,14] merely place ReadsMap in the Fgenesh++ pipeline and are not load-bearing for the benchmark claims. Possible concerns about benchmark representativeness, simulated 40x coverage favoring the cross-read mechanism, or the fairness of the STAR/PASS baselines are correctness risks, not circularity.

Assumptions & free parameters 7 free parameters · 6 assumptions · 0 invented entities

The paper introduces no new physical entities. The central results rest on hand-chosen algorithmic thresholds and on domain assumptions about read simulation, splice-site signals, intron length distributions, and the reliability of read support for intron rebuilding.

free parameters (7)

k-mer length (k) = 12
Default k-mer size used to build the hash index and seed matches; chosen by hand to balance sensitivity and runtime.
Minimum number of k-mer matches on a diagonal = 7
Diagonal is considered a potential alignment nucleus only if it has at least 7 matching k-mers; controls sensitivity.
Minimum nucleus length/homology thresholds = 13/20/26 bp at 91.5% homology for read lengths 50/76/100
Nucleus length and homology cutoffs for short reads; derived from read length, assumed intron count, and minimum exon length.
Minimum unaligned flank length for splice search = 6 bp
Flanks shorter than 6 bp are considered too short to reliably call a splice site on their own; central to the intron-rebuilding step.
Splice site search window = 16 nucleotides
Potential splice sites are searched no more than 16 nt away from the alignment boundary.
Score retention threshold = 96%
Alternative alignments with score below 96% of the maximum are discarded; directly affects specificity and sensitivity trade-off.
Intron length bounds = minimum intron size to 99th percentile of genome intron length distribution
Search for the second alignment block is restricted to this distance range; wrong distribution could exclude true introns.

assumptions (6)

domain assumption Reads are generated from the reference genome (or a close variant) with sequencing errors approximated by the SimSeq default profile.
The synthetic benchmark assumes simulated reads resemble real sequencing output; no real RNA-seq validation is provided.
domain assumption Splice junctions are marked by canonical splice sites at or near alignment boundaries.
The algorithm searches for splice sites within 16 nt of the boundary and weights them; non-canonical or distant splicing would not be found.
domain assumption Intron length distribution of the target genome is known and accurate.
The multi-block alignment search limits intron size between the genome's minimum intron and 99th percentile; a wrong distribution breaks spliced read detection.
domain assumption Other reads that share the same intron provide reliable evidence for placing short flanks.
The second-pass intron rebuilding transfers 1-5 bp fragments based on supporting alignments; if support is spurious, misalignments propagate.
domain assumption The standard alignment scoring using homology and block lengths is sufficient to choose a correct read position.
Reads/pairs are assigned to the highest-scoring alignment; ties are resolved by arbitrary preference for spliced alignments.
domain assumption The reference human genome hg19 and UCSC annotations are correct.
Simulated reads are sampled from chr22 mRNA sequences; errors in annotation propagate to miscalculated sensitivity/specificity.

how reviews work

0 comments

Cite this review

Pith. "Pith review of ReadsMap: a new tool for high precision mapping of DNAseq and RNAseq read sequences." pith.science (2026). https://pith.science/paper/XUWSNVFH

@misc{pith2026190801445,
  author       = {Pith},
  title        = {Pith review of: ReadsMap: a new tool for high precision mapping of DNAseq and RNAseq read sequences},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XUWSNVFH}},
  note         = {Machine review of arXiv:1908.01445}
}

read the original abstract

There are currently plenty of programs available for mapping short sequences (reads) to a genome. Most of them, however, including such popular and actively developed programs as Bowtie, BWA, TopHat and many others, are based on Burrows-Wheeler Transform (BWT) algorithm. This approach is very effective for mapping high-homology reads, but runs into problems when mapping reads with high level of errors or SNP. Also it has problems with mapping RNASeq spliced reads (such as reads that aligning with gaps corresponding intron sequences), the kind that is essential for finding introns and alternative splicing gene isoforms. Meanwhile, finding intron positions is the most important task for determining the gene structure, and especially alternatively spliced variants of genes. In this paper, we propose a new algorithm that involves hashing reference genome. ReadsMap program, implementing such algorithm, demonstrate very high-accuracy mapping of large number of short reads to one or more genomic contigs. It is achieved mostly by better alignment of very short parts of reads separated by long introns with accounting information from mapping other reads containing the same intron inserted between bigger blocks. Availability and implementation: ReadsMap is implemented in C. It is incorporated in Fgenesh++ gene identification pipeline and is freely available to academic users at Softberry web server www.softberry.com.

Figures

Figures reproduced from arXiv: 1908.01445 by the authors.

**Figure 1.** Work flow in ReadsMap program (Stage 1 and 2): loading a read for correction; removing lowquality terminal nucleotides; search for alignment nuclei; adding to a list of nuclei; extension of nuclei; adding to a list of spliced alignments; adding to a list of non-spliced alignments; selecting alignments supporting paired reads; loading the next read for analysis; generating a list of all reads’ alignments; constructi… view at source ↗

**Figure 5.** An example of problem with reads mapping due to alternative splicing. A. Alternatively spliced isoforms of GAB4 gene (a and b); c and d are two possible read alignments; 1,2,4 are exons of isoforms a and b; 3 is the short region with the same nucleotide sequence; arrows are intron sequences. B. “Incorrect” mapping variant of spliced alignment. Nucleotides aligned with the wrong exon shown in bold. 1 11 17468918 1746… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

2 extracted references · 1 canonical work pages

[3]

Incorrect

Number of correct alignments 4. Specificity (Sp) – the ratio of correct alignments to all found alignments 5. Sensitivity (Sn) - the ratio of correct alignments to the number of reads 6. F1 score: 2*(Sn*Sp)/(Sn+Sp) 7. G-measure =sqrt (Sn*Sp) Accuracy for potentially spliced (RNASeq reads). Results of reads mapping from the test sets by ReadsMap program ar...

work page
[5]

Evaluation: From Precision, Recall and F-Factor to ROC, Informedness, Markedness & Correlation

Campagna D, Albiero A, Bilardi A, Caniato E, Forcato C, Manavski S, Vitulo N, Valle G. PASS: a program to align short sequences. Bioinformatics. 2009; 25(7):967-8. 6. Campagna D, Telatin A, Forcato C, Vitulo N, Valle G. PASS-bis: a bisulfite aligner suitable for whole methylome analysis of Illumina and SOLiD reads. Bioinformatics. 2013; 29(2):268-70. 7. L...

2007

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [3]

Incorrect

Number of correct alignments 4. Specificity (Sp) – the ratio of correct alignments to all found alignments 5. Sensitivity (Sn) - the ratio of correct alignments to the number of reads 6. F1 score: 2*(Sn*Sp)/(Sn+Sp) 7. G-measure =sqrt (Sn*Sp) Accuracy for potentially spliced (RNASeq reads). Results of reads mapping from the test sets by ReadsMap program ar...

work page

[2] [5]

Evaluation: From Precision, Recall and F-Factor to ROC, Informedness, Markedness & Correlation

Campagna D, Albiero A, Bilardi A, Caniato E, Forcato C, Manavski S, Vitulo N, Valle G. PASS: a program to align short sequences. Bioinformatics. 2009; 25(7):967-8. 6. Campagna D, Telatin A, Forcato C, Vitulo N, Valle G. PASS-bis: a bisulfite aligner suitable for whole methylome analysis of Illumina and SOLiD reads. Bioinformatics. 2013; 29(2):268-70. 7. L...

2007