PubMed Health⌕ Search

PubMed · 12521234

Classification of renal proteinuria: a simple algorithm.

Abstract

Total protein, albumin, alpha1-microglobulin, and immunoglobulin G (IgG) were analyzed in 1,622 urine samples without Bence-Jones proteinuria or gross hematuria. There was correlation with the histological picture obtained on renal biopsy in 61 patients. We established 24-h reference intervals for alpha1-microglobulin and IgG on 659 urine samples with total protein and albumin excretion rates below 100 mg/24 h and 30 mg/24 h, respectively, and creatinine clearance above 80 ml/min. The central 95% reference interval was found to be between 4 and 17 mg/24 h for alpha1-microglobulin and between 3 and 8.5 mg/24 h for IgG. In 80 urine samples with albumin excretion rate above 30 mg/24 h and alpha1-microglobulin and IgG within their reference intervals, we analyzed the 95% central interval of the distribution of the IgG/albumin ratios, and it was found to be within 0.01 and 0.20 (0.90 confidence interval: 0.17-0.24). Proteinuria was considered to be of the selective glomerular type if the albumin excretion rate was abnormal and the IgG/albumin ratio was under 0.20, even when the IgG excretion was within a pathological range. For the classification of proteinuria as predominantly tubular, we estimated the alpha1-microglobulin/albumin ratio in 173 urine samples with normal excretion rates of albumin and IgG and pathological excretion of alpha1-microglobulin. The discriminating value of 0.91 (0.90 confidence interval: 0.78-1.08) was accepted in order to define proteinuria of a tubular origin in the presence of a pathological albumin excretion rate. The association between albumin and IgG excretion rates and tubular reabsorption of the alpha1-microglobulin normally filtered by the glomerulus was studied in 33 urine samples from patients with no histologically significant tubulo-interstitial or vascular disease and a serum creatinine concentration below 141 pmol/l. The optimal curve-fitting function between albumin plus IgG and alpha1-microglobulin excretion rates was of the quadratic type (r = 0.927). Mixed proteinuria was considered when both, albumin and alpha1-microglobulin excretion rates were pathological and could not be included in the previously described groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Enrique Bergón, Rosario Granados, Pilar Fernández-Segoviano, Elena Miravalles, Marta Bergón. 2002. Classification of renal proteinuria: a simple algorithm.. https://doi.org/10.1515/cclm.2002.201

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗