On the public citation graph

qPMS9: An Efficient Algorithm for Quorum Planted Motif Search

https://doi.org/10.1038/srep07813
0 signed · 50 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.1016/j.jda.2007.03.003openalex-snapshot
Lossless filter for multiple repetitions with Hamming distance
inferredcites →https://doi.org/10.1016/s0890-5401(03)00057-9openalex-snapshot
Distinguishing string selection problems
inferredcites →https://doi.org/10.1089/10665270252935430openalex-snapshot
Finding Motifs Using Random Projections
inferredcites →https://doi.org/10.1089/cmb.2005.12.1117openalex-snapshot
Exact Algorithms for Planted Motif Problems
inferredcites →https://doi.org/10.1093/bioinformatics/18.suppl_1.s354openalex-snapshot
Finding composite regulatory patterns in DNA sequences
inferredcites →https://doi.org/10.1093/bioinformatics/btg1072openalex-snapshot
Finding subtle motifs by branching from sample strings
inferredcites →https://doi.org/10.1109/iccabs.2012.6182627openalex-snapshot
PMS6: A fast algorithm for motif discovery
inferredcites →https://doi.org/10.1109/ipdps.2014.51openalex-snapshot
Finding Motifs in Biological Sequences Using the Micron Automata Processor
inferredcites →https://doi.org/10.1109/tcbb.2007.70241openalex-snapshot
Fast and Practical Algorithms for Planted (l, d) Motif Search
inferredcites →https://doi.org/10.1109/tcbb.2014.2306842openalex-snapshot
Improved Exact Enumerative Algorithms for the Planted ( $l$ , $d$ )-Motif Search Problem
inferredcites →https://doi.org/10.1186/1471-2105-12-410openalex-snapshot
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
inferredcites →https://doi.org/10.1186/1471-2105-15-34openalex-snapshot
Efficient sequential and parallel algorithms for planted motif search
inferredcites →https://doi.org/10.1186/1756-0500-4-54openalex-snapshot
A speedup technique for (l, d)-motif finding algorithms
inferredcites →https://doi.org/10.1371/journal.pone.0041425openalex-snapshot
qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences
inferredcites →https://doi.org/10.1371/journal.pone.0048442openalex-snapshot
PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-18174-1_16openalex-snapshot
Efficient Algorithms for Finding Edit-Distance Based Motifs
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_8openalex-snapshot
Designing and Implementing Algorithms for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/s00500-023-09236-zopenalex-snapshot
A new efficient quorum planted (ℓ, d) motif search on ChIP-seq dataset using segmentation to filtration and freezing firefly algorithms
inferred← citeshttps://doi.org/10.1007/s11517-021-02468-xopenalex-snapshot
Freezing firefly algorithm for efficient planted (ℓ, d) motif search
inferred← citeshttps://doi.org/10.1007/s12652-024-04812-zopenalex-snapshot
Finding the transcription factor binding locations using novel algorithm segmentation to filtration (S2F)
inferred← citeshttps://doi.org/10.1007/s40012-019-00235-wopenalex-snapshot
High performance computing approach for DNA motif discovery
inferred← citeshttps://doi.org/10.1016/j.gene.2017.10.001openalex-snapshot
Presence of a consensus DNA motif at nearby DNA sequence of the mutation susceptible CG nucleotides
inferred← citeshttps://doi.org/10.1016/j.ijcce.2024.07.004openalex-snapshot
Trie-PMS8: A trie-tree based robust solution for planted motif search problem
inferred← citeshttps://doi.org/10.1016/j.micpro.2016.06.008openalex-snapshot
Parallel implementation of quorum planted (ℓ, d ) motif search on multi-core/many-core platforms
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.017openalex-snapshot
Designing and implementing algorithms for the closest string problem
inferred← citeshttps://doi.org/10.1049/iet-nbt.2016.0005openalex-snapshot
Parallel implementation of D‐Phylo algorithm for maximum likelihood clusters
inferred← citeshttps://doi.org/10.1109/access.2019.2940115openalex-snapshot
A New Efficient Algorithm for Quorum Planted Motif Search on Large DNA Datasets
inferred← citeshttps://doi.org/10.1109/bibm.2015.7359740openalex-snapshot
Improved algorithms for finding edit distance based motifs
inferred← citeshttps://doi.org/10.1109/bibm.2015.7359745openalex-snapshot
Reference sequence selection for motif searches
inferred← citeshttps://doi.org/10.1109/bibm.2016.7822598openalex-snapshot
qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem
inferred← citeshttps://doi.org/10.1109/bibm.2017.8218010openalex-snapshot
An automatic motif recognition algorithm in DNA sequences based on particle swarm optimization and random projection
inferred← citeshttps://doi.org/10.1109/ccwc.2019.8666485openalex-snapshot
Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing
inferred← citeshttps://doi.org/10.1109/eict54103.2021.9733453openalex-snapshot
An Efficient Metaheuristic Approach for Finding Motifs from DNA Sequences
inferred← citeshttps://doi.org/10.1109/eit.2019.8834006openalex-snapshot
qSMF: an Approximate Algorithm for Quotum Planted Motif Search on ChIP-Seq Data
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00031openalex-snapshot
PDMF: Parallel Dictionary Motif Finder on Multicore and GPU
inferred← citeshttps://doi.org/10.1109/tcbb.2020.3024222openalex-snapshot
EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs
inferred← citeshttps://doi.org/10.1109/tcbb.2024.3404136openalex-snapshot
An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence Datasets
inferred← citeshttps://doi.org/10.1142/s0219720019500215openalex-snapshot
A new algorithm for DNA motif discovery using multiple sample sequence sets
inferred← citeshttps://doi.org/10.1155/2016/4986707openalex-snapshot
PairMotifChIP: A Fast Algorithm for Discovery of Patterns Conserved in Large ChIP-seq Data Sets
inferred← citeshttps://doi.org/10.1155/2019/3854646openalex-snapshot
Discovery of DNA Motif Utilising an Integrated Strategy Based on Random Projection and Particle Swarm Optimization
inferred← citeshttps://doi.org/10.11591/ijeecs.v27.i2.pp1109-1118openalex-snapshot
A survey of exact motif finding algorithms
inferred← citeshttps://doi.org/10.11648/j.cbb.20160402.11openalex-snapshot
A New Idea for Improving the Running Time of PMS Algorithm
inferred← citeshttps://doi.org/10.1186/s12859-016-1130-6openalex-snapshot
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
inferred← citeshttps://doi.org/10.1186/s12859-018-2242-yopenalex-snapshot
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets
inferred← citeshttps://doi.org/10.1186/s12864-016-2789-9openalex-snapshot
Efficient sequential and parallel algorithms for finding edit distance based motifs
inferred← citeshttps://doi.org/10.1186/s12864-019-5701-6openalex-snapshot
Novel algorithms for LDD motif search
inferred← citeshttps://doi.org/10.22266/ijies2018.0831.01openalex-snapshot
An Intuitive Wizard to Identify Pattern in Similarity Expressed Gene Set of Rice
inferred← citeshttps://doi.org/10.3390/fi15030113openalex-snapshot
CvAMoS—Event Abstraction Using Contextual Information
inferred← citeshttps://doi.org/10.3390/s22031204openalex-snapshot
A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose
inferred← citeshttps://doi.org/10.5120/ijca2015905745openalex-snapshot
Load Balancing for Parallel Motif Discoveries
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.