STR: Polysemous Applications in Science & Tech

• STR is a polysemous acronym defined by its disciplinary context, referring to concepts like short tandem repeats in genetics and scene text recognition in computer vision.
• Applications of STR span forensic DNA analysis, temporal trend decomposition, wireless full-duplex systems, and algorithmic methods in mathematical physics.
• Its practical use requires careful contextual interpretation, ensuring accurate application of methodologies and performance metrics across diverse research fields.

to=arxiv_search.search 手机天天中彩票{"query":"STR arXiv acronym Y chromosome STR scene text recognition simultaneous transmit and receive seasonal-trend decomposition", "max_results": 10} to=arxiv_search.search აციას 大发彩票网 天天中彩票未json{"query":"(Wang et al., 2013, Andersen et al., 2013, Hu et al., 2022, Lyu et al., 2023, Shao et al., 2023, Dokumentov et al., 2020, Choorakuzhiyil et al., 7 Jan 2025, Wang et al., 13 Feb 2025, Preti, 2018, Chen et al., 2021)", "max_results": 20} STR is a polysemous technical acronym whose meaning is fixed by disciplinary context rather than by any single canonical definition. In contemporary research usage it denotes, among other things, short tandem repeats in genetics and forensic DNA analysis, scene text recognition and scene text removal in computer vision, Semantic Textual Relatedness in natural language processing, the SpatioTemporal Relevance score in training-free video editing, Simultaneous Transmit and Receive in full-duplex wireless systems, Star-Triangle Relations in Feynman-integral computation, Spatial Transformation Routing in scene representation, and Seasonal-Trend decomposition using Regression in time-series analysis (Wang et al., 2013, Hu et al., 2022, Ebrahimi et al., 2024, Lee et al., 28 Jun 2025, Choi et al., 2013, Preti, 2018, Chen et al., 2021, Dokumentov et al., 2020).

1. Acronym scope and disciplinary polysemy

Because STR is reused across unrelated literatures, interpretation depends on the surrounding task definition, data modality, and notation. The same three letters may refer to a biological marker family, an OCR task, a wireless duplexing mode, a statistical decomposition method, or a graph-based representation mechanism.

Expansion	Domain	Representative paper
Short tandem repeats	Y-chromosome genetics, forensic DNA	(Wang et al., 2013)
Scene text recognition	Computer vision, OCR	(Hu et al., 2022)
Semantic Textual Relatedness	NLP	(Ebrahimi et al., 2024)
SpatioTemporal Relevance score	Video editing	(Lee et al., 28 Jun 2025)
Simultaneous Transmit and Receive	Full-duplex wireless	(Choi et al., 2013)
Star-Triangle Relations	Feynman integrals	(Preti, 2018)
Spatial Transformation Routing	Novel-view rendering	(Chen et al., 2021)
Seasonal-Trend decomposition using Regression	Time-series analysis	(Dokumentov et al., 2020)

Two further uses illustrate how local notation constrains interpretation. In generalized constrained longest common subsequence, STR denotes the substring-based variants such as STR-EC-LCS, in contrast to sequence-based variants (Yamada et al., 2020). In “Str-L Pose,” Str-L means Structured Line, and not a standalone STR module (Zhang et al., 2024).

2. STR in genetics and forensic DNA analysis

In human genetics, STRs are repeat-number polymorphisms, and on the Y chromosome they are commonly paired with SNP-defined haplogroups. One study assembled a worldwide dataset of 20,403 Y chromosomes with paired SNP and STR data and showed that although STR-based neighbor-joining structure broadly recapitulates the Y-chromosome tree, haplotype convergence across distinct SNP haplogroups can materially compromise haplogroup prediction. The paper reports, for example, that only 18% of haplogroup B samples were correctly inferred, while 26% were misclassified as I2 or IJ and 21% as R; it also reports 22% C1-to-E1b1b1 errors, 37% C2/C2a/C2a1-to-E1b1a1 errors, and about 20% H1/H1a-to-J errors. The underlying explanation is homoplasy under much faster STR mutation relative to Y-SNPs, combined with finite marker panels such as the 10-locus and 17-locus sets used in practice (Wang et al., 2013).

A separate line of work treats Y-STRs as a frequency-estimation problem rather than a haplogroup-classification problem. The discrete Laplace method models a locus as

$$f(X=x; p,y) = \frac{1-p}{1+p} \cdot p^{|x-y|}, \quad x \in \mathbb{Z},$$

and extends this to mixtures of multivariate, marginally independent discrete Laplace distributions for haplotypes. In simulation under a Fisher-Wright model with single-step mutation, the method recovered central haplotypes exactly in the one-population and two-population examples, identified the correct number of latent subpopulations by BIC, and produced haplotype-frequency predictions that tracked the true population frequencies reasonably well on log-log plots (Andersen et al., 2013).

In forensic DNA interpretation, STR denotes autosomal short tandem repeat loci measured through electropherograms. A unifying probabilistic-genotyping framework models the full path from contributor DNA through extraction, sampling, PCR amplification, amplicon formation, and fluorescent detection using univariate and multivariate probability generating functions. The likelihood-ratio structure is written as

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$

and the PCR stage is modeled as a discrete multi-type branching process. The paper’s emphasis is that low-template and mixed samples are better understood when dropout, stutter, drop-in, degradation, and baseline noise are modeled at the molecular-process level rather than only at the final peak-height stage (Cowell, 2018).

3. STR in computer vision: recognition, removal, and certification

In computer vision, STR frequently abbreviates scene text recognition. In the out-of-vocabulary setting, the “Vision-Language Adaptive Mutual Decoder” paper argues that conventional autoregressive STR systems over-rely on learned lexical priors, harming recognition of toponyms, business names, URLs, and random strings. Its VLAMD architecture combines an attention-LSTM main branch, an auxiliary autoregressive transformer decoder, bidirectional training, and mutual sequential decoding, and reports 70.31\% word accuracy on IV+OOV and 59.61\% on OOV in the OOV-ST Challenge, with first place in both settings (Hu et al., 2022).

Event-based sensing introduces another STR meaning within the same vision literature. “EventSTR” defines event-stream-based scene text recognition as a distinct task and introduces a benchmark with 9,928 high-definition (1280 * 720) event samples involving both Chinese and English characters. The proposed SimC-ESTR framework combines an EVA-CLIP visual encoder, a Q-former, a memory-based vision-token augmentation mechanism, and a similarity-based glyph error correction module inside a frozen Vicuna-7B stack. On EventSTR it reports BLEU-1 = 0.638, BLEU-2 = 0.583, BLEU-3 = 0.500, and BLEU-4 = 0.430, outperforming the listed conventional baselines and BLIVA on that benchmark (Wang et al., 13 Feb 2025).

A distinct but related usage is scene text removal, where the task is to erase text regions and reconstruct plausible background. FETNet diagnoses standard encoder-decoder skip connections as problematic because encoded features contain both background information and the very text texture and structure that removal should suppress. It introduces a Feature Erasing Module, attention-based similarity guidance, and a Feature Transferring Module inside a one-stage network, and also releases the Flickr-ST dataset with multi-category annotations. Reported results include PSNR 34.53 on SCUT-EnsText, 33.61 on Flickr-ST, and 39.14 on SCUT-Syn, with a model size of 8.53M parameters and 4.62 ms inference time on SCUT-Syn (Lyu et al., 2023).

Formal robustness introduces yet another sense in which STR is task-defining rather than architectural shorthand. STR-Cert extends the DeepPoly polyhedral verification framework to scene text recognition models, including TPS-based pipelines with CTC or attention decoding and ViTSTR. It derives bounds for TPS rectification, patch embedding, positional encoding, refined Softmax abstraction using the simplex constraint, and a CTC decoder certification algorithm. Across six datasets, the paper reports that ViTSTR is markedly easier to certify than LSTM-based pipelines; for example, on IIIT5K the certified percentages for ViTSTR are 97.5\% / 75.0\% / 57.5\% / 24.0\% at $\epsilon=.001,.003,.005,.01$, with average certification runtime 14s versus 49s for CTC and 92s for attention models (Shao et al., 2023).

4. STR in language, video, and scene representation

In NLP, STR denotes Semantic Textual Relatedness, a regression task over sentence pairs in which the output is a real-valued score in $[0,1]$. “Sharif-STR” formulates SemEval-2024 Task 1 Track A as

$\hat{y} = f_\theta(x_1, x_2),$

uses a RoBERTa backbone with a single-output regression head, optimizes Mean Squared Error, and reports test Spearman correlation of 0.82 for English, 0.67 for Spanish, and 0.38 for Arabic. The paper attributes the weaker Arabic result to scarcer labeled data and differences in model suitability across Latin and non-Latin languages (Ebrahimi et al., 2024).

In video editing, STR can mean the SpatioTemporal Relevance score. STR-Match defines a directional relevance between token $I_i(p)$ in frame $i$ and token $I_j(q)$ in frame $j$ by composing 2D spatial attention with 1D temporal attention, then symmetrizes and aggregates across neighboring frames:

$$g(I_i(p) \rightarrow I_j(q)) := \mathrm{Attn}(I_i(p) \rightarrow I_j(p))\, \mathrm{Attn}(I_j(p)\rightarrow I_j(q)) + \mathrm{Attn}(I_i(p)\rightarrow I_i(q))\, \mathrm{Attn}( I_i(q) \rightarrow I_j(q)),$$

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$0

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$1

This score is matched between source and target videos during latent optimization. On 54 videos with 16 frames each, the paper reports for STR-Match w/ mask: FC 0.981, CS 31.68, BL 0.103, and ME 1.932, outperforming the listed training-free baselines in overall balance between fidelity and spatiotemporal consistency (Lee et al., 28 Jun 2025).

In generative scene representation, STR can stand for Spatial Transformation Routing. STR-GQN replaces explicit camera-intrinsic-dependent geometry modules with a pose-conditioned routing process between view cells and world cells. The core routing equations are

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$2

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$3

with the relation matrix generated from learned spatial embeddings by

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$4

An accompanying Occupancy Concept Mapping interpretation defines scene cells as sigmoid-transformed accumulated log-odds. In the comparison against GRNN, STR-GQN reports cross-entropy 0.079 on ShapeNet, 0.072 on SM7, and 0.494 on RRC, while also showing smaller degradation than GRNN under stretch and distortion perturbations (Chen et al., 2021).

5. STR in wireless communications and networking

In wireless systems, STR usually means Simultaneous Transmit and Receive, i.e. full duplex in the same frequency band at the same time. The central PHY obstacle is self-interference: for a transmitted passband signal $$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$5, the received signal is modeled as

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$6

where $$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$7 is the echo. Because a high-power transmit echo can saturate the LNA and make pure digital cancellation unrealistic, the paper proposes a closed-loop analog echo canceller that synthesizes

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$8

from delayed, phase-shifted transmit replicas and updates weights by

$$LR=\frac{L(H_p)}{L(H_d)}=\frac{\Pr(E\mid H_p)}{\Pr(E\mid H_d)},$$9

The paper reports more than 110 dB suppression in an idealized analog simulation, strong robustness to phase noise, and CSMA-network throughput gains of up to 279\% under its d-STR protocol. It also identifies the new cellular interference modes created by STR—BS-BS interference and UE-UE interference—and proposes elevation-domain null forming and resource-block-based control to mitigate them (Choi et al., 2013).

A Wi-Fi 7 specific usage appears in the context of Multi-Link Operation (MLO). There, STR denotes an MLO mode in which a multi-link device can use multiple links concurrently, in contrast to EMLSR, where the device can listen on multiple links but can transmit on only one link at a time because of its single-radio constraint. Using ns-3.41, one study reports baseline saturation throughput of about 120 Mbps for STR around $\epsilon=.001,.003,.005,.01$0, compared with about 60 Mbps for EMLSR and 30 Mbps for SLO around $\epsilon=.001,.003,.005,.01$1. The paper concludes that STR is preferable for high-load, throughput- and latency-sensitive scenarios, while also noting that its own abstract’s discussion of energy efficiency is not backed by direct energy measurements in the reported experiments (Choorakuzhiyil et al., 7 Jan 2025).

6. STR in mathematical, statistical, and algorithmic methods

In mathematical physics, STR can denote Star-Triangle Relations. The Mathematica package of that name implements the method of uniqueness for massless Euclidean position-space Feynman integrals in arbitrary Euclidean spacetime dimension $\epsilon=.001,.003,.005,.01$2. It automates scalar and Yukawa identities, including the scalar star-triangle relation

$\epsilon=.001,.003,.005,.01$3

and defines a star as unique when $\epsilon=.001,.003,.005,.01$4, a triangle as unique when $\epsilon=.001,.003,.005,.01$5. The package targets interactive reduction of conformal multi-loop integrals rather than generic IBP-style reduction (Preti, 2018).

In time-series analysis, STR means Seasonal-Trend decomposition using Regression. The method rewrites decomposition as a regularized linear model,

$\epsilon=.001,.003,.005,.01$6

with second-difference penalties on trend, seasonal surfaces, and time-varying covariate coefficients. The resulting augmented regression system

$\epsilon=.001,.003,.005,.01$7

has closed-form estimator

$\epsilon=.001,.003,.005,.01$8

and covariance

$\epsilon=.001,.003,.005,.01$9

The paper’s emphasis is flexibility: multiple seasonal and cyclic components, covariates, non-integer periods through functional bases, complex seasonal topology, and confidence intervals unavailable in most classical decomposition procedures (Dokumentov et al., 2020).

In string algorithms, STR is not an acronym for a standalone method but a qualifier meaning substring-based. STR-EC-LCS is the substring-excluding constrained longest common subsequence problem, where the goal is to find the longest common subsequence of $[0,1]$0 and $[0,1]$1 that does not contain $[0,1]$2 as a substring. The paper replaces the earlier $[0,1]$3 dynamic program with an output-sensitive method running in

$[0,1]$4

where $[0,1]$5, $[0,1]$6, $[0,1]$7, $[0,1]$8 is the number of distinct characters occurring in both $[0,1]$9 and $\hat{y} = f_\theta(x_1, x_2),$0, and $\hat{y} = f_\theta(x_1, x_2),$1 is the length of the optimal STR-EC-LCS (Yamada et al., 2020).

A final boundary case occurs in relative pose estimation. “Str-L Pose” introduces a dual-graph network that integrates matched points with matched line segments, but the paper is explicit that Str-L = Structured Line rather than a generic STR mechanism. Its use is therefore relevant mainly as a disambiguation example: local typography can resemble “STR” while denoting a different, longer expression (Zhang et al., 2024).