On the public citation graph

Choosing non‐redundant representative subsets of protein sequence data sets using submodular optimization

https://doi.org/10.1002/prot.25461
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cyto.a.20430openalex-snapshot
A multi‐model approach to simultaneous segmentation and classification of heterogeneous populations of cell nuclei in 3D confocal microscope images
inferredcites →https://doi.org/10.1002/pro.5560010313openalex-snapshot
Selection of representative protein data sets
inferredcites →https://doi.org/10.1006/jmbi.1990.9999openalex-snapshot
Basic Local Alignment Search Tool
inferredcites →https://doi.org/10.1006/jmbi.1995.0159openalex-snapshot
SCOP: A structural classification of proteins database for the investigation of sequences and structures
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf01753431openalex-snapshot
Cores of convex games
inferredcites →https://doi.org/10.1007/bf02579435openalex-snapshot
An analysis of the greedy algorithm for the submodular set covering problem
inferredcites →https://doi.org/10.1007/bfb0006528openalex-snapshot
Accelerated greedy algorithms for maximizing submodular set functions
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0167-5060(08)70678-2openalex-snapshot
Chapter 9 Submodular Functions
inferredcites →https://doi.org/10.1016/s0168-9525(00)02024-2openalex-snapshot
EMBOSS: The European Molecular Biology Open Software Suite
inferredcites →https://doi.org/10.1038/490479aopenalex-snapshot
Planetary science: The search for Earth's twin
inferredcites →https://doi.org/10.1038/nature11234openalex-snapshot
Structure, function and diversity of the healthy human microbiome
inferredcites →https://doi.org/10.1057/jors.1991.208openalex-snapshot
Discrete Location Theory
inferredcites →https://doi.org/10.1073/pnas.0308067101openalex-snapshot
Protein ranking: From local to global structure in the protein similarity network
inferredcites →https://doi.org/10.1093/bioinformatics/14.5.423openalex-snapshot
Removing near-neighbour redundancy from large protein sequence collections.
inferredcites →https://doi.org/10.1093/bioinformatics/14.9.783openalex-snapshot
Domain identification by clustering sequence alignments.
inferredcites →https://doi.org/10.1093/bioinformatics/16.5.451openalex-snapshot
GeneRAGE: a robust algorithm for sequence clustering and domain detection
inferredcites →https://doi.org/10.1093/bioinformatics/17.3.282openalex-snapshot
Clustering of highly homologous sequences to reduce the size of large protein databases
inferredcites →https://doi.org/10.1093/bioinformatics/8.5.461openalex-snapshot
Clustering cDNA sequences
inferredcites →https://doi.org/10.1093/bioinformatics/btg224openalex-snapshot
PISCES: a protein sequence culling server
inferredcites →https://doi.org/10.1093/bioinformatics/btl158openalex-snapshot
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
inferredcites →https://doi.org/10.1093/bioinformatics/btq461openalex-snapshot
Search and clustering orders of magnitude faster than BLAST
inferredcites →https://doi.org/10.1093/nar/25.17.3389openalex-snapshot
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
inferredcites →https://doi.org/10.1093/nar/28.1.254openalex-snapshot
The ASTRAL compendium for protein structure and sequence analysis
inferredcites →https://doi.org/10.1093/nar/30.7.1575openalex-snapshot
An efficient algorithm for large-scale detection of protein families
inferredcites →https://doi.org/10.1093/nar/gkj515openalex-snapshot
Spectral clustering of protein sequences
inferredcites →https://doi.org/10.1109/focs.2012.73openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferredcites →https://doi.org/10.1109/icassp.2013.6639057openalex-snapshot
Submodular feature selection for high-dimensional acoustic score spaces
inferredcites →https://doi.org/10.1109/icassp.2014.6854213openalex-snapshot
Submodular subset selection for large-scale speech training data
inferredcites →https://doi.org/10.1109/icde.2003.1260785openalex-snapshot
CLUSEQ: efficient and effective sequence clustering
inferredcites →https://doi.org/10.1126/science.1136800openalex-snapshot
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1137/090779346openalex-snapshot
Maximizing Non-monotone Submodular Functions
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1186/1471-2105-14-248openalex-snapshot
kClust: fast and sensitive clustering of large protein sequence databases
inferredcites →https://doi.org/10.1186/s13059-016-1089-7openalex-snapshot
Choosing panels of genomics assays using submodular optimization
inferredcites →https://doi.org/10.1201/9780203494455.ch1openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1371/journal.pone.0055484openalex-snapshot
Maximising the Size of Non-Redundant Protein Datasets Using Graph Theory
inferredcites →https://doi.org/10.1515/9781400822539openalex-snapshot
Supermodularity and Complementarity
inferredcites →https://doi.org/10.3115/v1/d14-1014openalex-snapshot
Submodularity for Data Selection in Machine Translation
inferredcites →https://doi.org/10.6026/97320630005234openalex-snapshot
Protein sequence redundancy reduction: comparison of various methods

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/prot.25669openalex-snapshot
Scalable remote homology detection and fold recognition in massive protein networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_89-1openalex-snapshot
Practical Submodular Maximization: A Primer
inferred← citeshttps://doi.org/10.1007/s00453-022-01071-2openalex-snapshot
Practical Budgeted Submodular Maximization
inferred← citeshttps://doi.org/10.1007/s40305-025-00640-wopenalex-snapshot
Introducing k-Replaceable Systems: A New Framework in Independent Systems
inferred← citeshttps://doi.org/10.1038/s41598-025-85165-1openalex-snapshot
Identifying representative sequences of protein families using submodular optimization
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa815openalex-snapshot
Enhancing statistical power in temporal biomarker discovery through representative shapelet mining
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa830openalex-snapshot
Prioritizing transcriptomic and epigenomic experiments using an optimization strategy that leverages imputed data
inferred← citeshttps://doi.org/10.1093/ismeco/ycae042openalex-snapshot
Quantifying microbial guilds
inferred← citeshttps://doi.org/10.1109/tcbb.2019.2935437openalex-snapshot
SPADIS: An Algorithm for Selecting Predictive and Diverse SNPs in GWAS
inferred← citeshttps://doi.org/10.1145/3388440.3412409openalex-snapshot
Submodular sketches of single-cell RNA-seq measurements
inferred← citeshttps://doi.org/10.1145/3580305.3599259openalex-snapshot
Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time
inferred← citeshttps://doi.org/10.1186/s13059-020-02229-3openalex-snapshot
Reference flow: reducing reference bias using multiple population genomes
inferred← citeshttps://doi.org/10.1609/aaai.v35i9.16998openalex-snapshot
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
inferred← citeshttps://doi.org/10.1613/jair.1.14323openalex-snapshot
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.64openalex-snapshot
Weakly Submodular Function Maximization Using Local Submodularity Ratio
inferred← citeshttps://doi.org/10.64659/jomi/220238openalex-snapshot
Computational Structural Analysis and Interaction Network Profiling of Lipases: Implications for Biomedical and Therapeutic Applications
inferred← citeshttps://doi.org/10.64898/2026.04.17.719243openalex-snapshot
Bi-level diversity optimisation for representative protein panel selection
inferred← citeshttps://doi.org/10.64898/2026.06.17.732946openalex-snapshot
ReSeT: a taxonomy-aware reference genome selection tool
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.