On the public citation graph

Sequence comparison with concave weighting functions

0 signed · 148 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/spe.4380180703openalex-snapshot
A simple row‐replacement method
inferredcites →https://doi.org/10.1007/bf01733210openalex-snapshot
Comparative biosequence metrics
inferredcites →https://doi.org/10.1007/bf02459503openalex-snapshot
Algorithms for computing evolutionary similarity measures with length independent gap penalties
inferredcites →https://doi.org/10.1007/bf02459506openalex-snapshot
RNA secondary structures and their prediction
inferredcites →https://doi.org/10.1016/0001-8708(76)90202-4openalex-snapshot
Some biological sequence metrics
inferredcites →https://doi.org/10.1016/0022-2836(70)90057-4openalex-snapshot
A general method applicable to the search for similarities in the amino acid sequence of two proteins
inferredcites →https://doi.org/10.1016/0022-2836(81)90087-5openalex-snapshot
Identification of common molecular subsequences
inferredcites →https://doi.org/10.1016/0022-2836(82)90398-9openalex-snapshot
An improved algorithm for matching biological sequences
inferredcites →https://doi.org/10.1016/0196-8858(86)90025-4openalex-snapshot
Rapid dynamic programming algorithms for RNA secondary structure
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1016/s0022-5193(84)80037-5openalex-snapshot
Efficient sequence alignment algorithms
inferredcites →https://doi.org/10.1016/s0022-5193(86)80112-6openalex-snapshot
Alignment of three biological sequences with an efficient traceback procedure
inferredcites →https://doi.org/10.1073/pnas.80.5.1382openalex-snapshot
Optimal sequence alignments
inferredcites →https://doi.org/10.1093/nar/12.1part1.175openalex-snapshot
Fast optimal alignment
inferredcites →https://doi.org/10.1137/0216043openalex-snapshot
The Least Weight Subsequence Problem
inferredcites →https://doi.org/10.1145/360825.360861openalex-snapshot
A linear space algorithm for computing maximal common subsequences
inferredcites →https://doi.org/10.1145/59287.59290openalex-snapshot
Row replacement algorithms for screen editors

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0134(19980701)32:1<88::aid-prot10>3.0.co;2-jopenalex-snapshot
Generalized affine gap costs for protein sequence alignment
inferred← citeshttps://doi.org/10.1002/0470011815.b2a05017openalex-snapshot
DNA Sequences
inferred← citeshttps://doi.org/10.1002/1520-6750(199306)40:4<459::aid-nav3220400404>3.0.co;2-8openalex-snapshot
The dynamic lot-sizing model with backlogging: A simpleo(n logn) algorithm and minimal forecast horizon procedure
inferred← citeshttps://doi.org/10.1002/9781118445112.stat05368openalex-snapshot
DNA Sequences
inferred← citeshttps://doi.org/10.1002/9781118445112.stat05368.pub2openalex-snapshot
DNA Sequence Evolution
inferred← citeshttps://doi.org/10.1002/net.20013openalex-snapshot
Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies
inferred← citeshttps://doi.org/10.1002/prot.340090304openalex-snapshot
A workbench for multiple alignment construction and analysis
inferred← citeshttps://doi.org/10.1002/spe.1096openalex-snapshot
High‐quality pagination for publishing
inferred← citeshttps://doi.org/10.1006/aama.1993.1008openalex-snapshot
Generalized Sequence Alignment and Duality
inferred← citeshttps://doi.org/10.1006/jagm.2000.1078openalex-snapshot
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
inferred← citeshttps://doi.org/10.1006/jagm.2001.1191openalex-snapshot
On the Common Substring Alignment Problem
inferred← citeshttps://doi.org/10.1006/jmbi.2000.3875openalex-snapshot
Accurate formula for P-values of gapped local sequence and profile alignments
inferred← citeshttps://doi.org/10.1006/mpev.2000.0785openalex-snapshot
Multiple Sequence Alignment in Phylogenetic Analysis
inferred← citeshttps://doi.org/10.1007/11415770_11openalex-snapshot
A High-Throughput Approach for Associating microRNAs with Their Activity Conditions
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_29openalex-snapshot
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_6openalex-snapshot
Approximate regular expression pattern matching with concave gap penalties
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_8openalex-snapshot
Parametric recomputing in alignment graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_208openalex-snapshot
Local Alignment (with Concave Gap Weights)
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_5openalex-snapshot
Efficient Algorithms with Applications to Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_17openalex-snapshot
Efficient Algorithms for Sequence Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_208openalex-snapshot
Local Alignment (with Concave Gap Weights)
inferred← citeshttps://doi.org/10.1007/978-1-84800-320-0openalex-snapshot
Sequence Comparison: Theory and Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_13openalex-snapshot
Two Algorithms for LCS Consecutive Suffix Alignment
inferred← citeshttps://doi.org/10.1007/978-3-642-02008-7_36openalex-snapshot
Learning Models for Aligning Protein Sequences with Predicted Secondary Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-15387-7_18openalex-snapshot
A Classification Algorithm for Process Sequences Based on Markov Chains and Bayesian Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_208-2openalex-snapshot
Local Alignment (with Concave Gap Weights)
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_14openalex-snapshot
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_15openalex-snapshot
Hypertext Searching - A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-50124-1_2openalex-snapshot
Genomes, Maps and Sequences
inferred← citeshttps://doi.org/10.1007/978-981-13-6037-4_8openalex-snapshot
Informatics for PacBio Long Reads
inferred← citeshttps://doi.org/10.1007/bf00160262openalex-snapshot
Finite-state models in the alignment of macromolecules
inferred← citeshttps://doi.org/10.1007/bf01188583openalex-snapshot
Linear-space algorithms that build local alignments from fragments
inferred← citeshttps://doi.org/10.1007/bf01188585openalex-snapshot
A robust model for finding optimal evolutionary trees
inferred← citeshttps://doi.org/10.1007/bf01300375openalex-snapshot
Approximate regular expression pattern matching with concave gap penalties
inferred← citeshttps://doi.org/10.1007/bf02458577openalex-snapshot
Optimal sequence alignment allowing for long gaps
inferred← citeshttps://doi.org/10.1007/bf02458580openalex-snapshot
Minimum message length encoding and the comparison of macromolecules
inferred← citeshttps://doi.org/10.1007/bf02458834openalex-snapshot
Approximate matching of regular expressions
inferred← citeshttps://doi.org/10.1007/bf02459635openalex-snapshot
A survey of multiple sequence comparison methods
inferred← citeshttps://doi.org/10.1007/bf02459636openalex-snapshot
AnO(N 2 logN) restriction map comparison and search algorithm
inferred← citeshttps://doi.org/10.1007/bf02460648openalex-snapshot
Constrained sequence alignment
inferred← citeshttps://doi.org/10.1007/bf02462264openalex-snapshot
Consistency of optimal sequence alignments
inferred← citeshttps://doi.org/10.1007/bfb0030790openalex-snapshot
Aligning alignments
inferred← citeshttps://doi.org/10.1007/s12275-015-4601-yopenalex-snapshot
Improved pipeline for reducing erroneous identification by 16S rRNA sequences using the Illumina MiSeq platform
inferred← citeshttps://doi.org/10.1016/0010-4825(89)90014-0openalex-snapshot
The ordering of the nucleotides in DNA: Computational problems in molecular biology
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90245-5openalex-snapshot
Identifying periodic occurences of a template with applications to protein structure
inferred← citeshttps://doi.org/10.1016/0076-6879(92)10029-dopenalex-snapshot
[27] Dynamic programming algorithms for biological sequence comparison
inferred← citeshttps://doi.org/10.1016/0096-3003(91)90103-topenalex-snapshot
Set-spectrum method in structure comparison and the concept of topological kinship
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90031-9openalex-snapshot
Sequence comparison with mixed convex and concave costs
inferred← citeshttps://doi.org/10.1016/0303-2647(93)90058-kopenalex-snapshot
Computation of biopolymers: A general approach to different problems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90101-1openalex-snapshot
Speeding up dynamic programming with applications to molecular biology
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90266-iopenalex-snapshot
On the space complexity of some algorithms for sequence comparison
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50041-5openalex-snapshot
10.1016/b978-044488002-4/50041-5
inferred← citeshttps://doi.org/10.1016/j.eswa.2005.09.043openalex-snapshot
A new dot plot-based algorithm for genomes sequences comparison: A preliminary study
inferred← citeshttps://doi.org/10.1016/j.ic.2016.02.001openalex-snapshot
Approximate matching between a context-free grammar and a finite-state automaton
inferred← citeshttps://doi.org/10.1016/j.jbi.2005.11.005openalex-snapshot
Homology assessment and molecular sequence alignment
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.004openalex-snapshot
Two algorithms for LCS Consecutive Suffix Alignment
inferred← citeshttps://doi.org/10.1016/s0005-2728(05)80100-8openalex-snapshot
Enzymes depending on the pterin molybdenum cofactor: sequence families, spectroscopic properties of molybdenum and possible cofactor-binding domains
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00053-8openalex-snapshot
A versatile divide and conquer technique for optimal string alignment
inferred← citeshttps://doi.org/10.1016/s0022-5193(89)80196-1openalex-snapshot
Gap costs for multiple sequence alignment
inferred← citeshttps://doi.org/10.1016/s0065-227x(99)80007-0openalex-snapshot
Multiple sequence alignment: Algorithms and applications
inferred← citeshttps://doi.org/10.1016/s0076-6879(96)66025-xopenalex-snapshot
[23] Combined DNA and protein alignment
inferred← citeshttps://doi.org/10.1016/s0092-8240(05)80078-3openalex-snapshot
An ( log ) restriction map comparison and search algorithm
inferred← citeshttps://doi.org/10.1016/s0097-8485(00)80006-6openalex-snapshot
Sequence complexity for biological sequence analysis
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00288-3openalex-snapshot
Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00074-2openalex-snapshot
Reconstructing a history of recombinations from a set of sequences
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00237-2openalex-snapshot
Application of Max-Plus algebra to biological sequence comparisons
inferred← citeshttps://doi.org/10.1023/b:mbil.0000015142.33879.82openalex-snapshot
Comparative Analysis of Nucleic Acid and Protein Primary Structures
inferred← citeshttps://doi.org/10.1038/ng0294-119openalex-snapshot
Issues in searching molecular sequence databases
inferred← citeshttps://doi.org/10.1080/0028825x.1993.10419499openalex-snapshot
The expected number of matches in optimal global sequence alignments
inferred← citeshttps://doi.org/10.1089/10665270050081478openalex-snapshot
A Greedy Algorithm for Aligning DNA Sequences
inferred← citeshttps://doi.org/10.1089/106652701300312931openalex-snapshot
A Sequence Alignment Algorithm with an Arbitrary Gap Penalty Function
inferred← citeshttps://doi.org/10.1089/cmb.1994.1.271openalex-snapshot
Recent Developments in Linear-Space Alignment Methods: A Survey
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.245openalex-snapshot
A High-Throughput Approach for Associating MicroRNAs with Their Activity Conditions
inferred← citeshttps://doi.org/10.1089/cmb.2009.0222openalex-snapshot
Aligning Protein Sequences with Predicted Secondary Structure
inferred← citeshttps://doi.org/10.1093/bioinformatics/10.4.379openalex-snapshot
Further improvement in methods of group-to-group sequence alignment with generalized profile operations
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.5.391openalex-snapshot
Comparison of genomic DNA sequences: solved and unsolved problems
inferred← citeshttps://doi.org/10.1093/bioinformatics/4.1.11openalex-snapshot
Optimal alignments in linear space
inferred← citeshttps://doi.org/10.1093/bioinformatics/8.5.481openalex-snapshot
Aligning two sequences within a specified diagonal band
inferred← citeshttps://doi.org/10.1093/bioinformatics/9.3.361openalex-snapshot
Optimal alignment between groups of sequences and its application to multiple sequence alignment
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa777openalex-snapshot
Fast gap-affine pairwise alignment using the wavefront algorithm
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaa865openalex-snapshot
Finding long tandem repeats in long noisy reads
inferred← citeshttps://doi.org/10.1093/bioinformatics/bti1200openalex-snapshot
DNA assembly with gaps (Dawg): simulating sequence evolution
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm095openalex-snapshot
Ngila: global pairwise alignments with logarithmic and affine gap costs
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm402openalex-snapshot
Transducers: an emerging probabilistic framework for modeling indels on trees
inferred← citeshttps://doi.org/10.1093/bioinformatics/btn460openalex-snapshot
Direct mapping and alignment of protein sequences onto genomic sequence
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts214openalex-snapshot
Dissect: detection and characterization of novel structural alterations in transcribed sequences
inferred← citeshttps://doi.org/10.1093/nar/gkh610openalex-snapshot
Frequency of gaps observed in a structurally aligned protein pair database suggests a simple gap penalty function
inferred← citeshttps://doi.org/10.1101/pdb.top40openalex-snapshot
Using Gaps and Gap Penalties to Optimize Pairwise Sequence Alignments
inferred← citeshttps://doi.org/10.1109/hicss.1992.183219openalex-snapshot
Minimum message length encoding, evolutionary trees and multiple-alignment
inferred← citeshttps://doi.org/10.1109/hicss.1993.270687openalex-snapshot
Dynamic methods for fragment assembly in large scale genome sequencing projects
inferred← citeshttps://doi.org/10.1109/hicss.1994.323593openalex-snapshot
Generalized suffix trees for biological sequence data: applications and implementation
inferred← citeshttps://doi.org/10.1109/iccabs.2012.6182645openalex-snapshot
The ruzzo-tompa algorithm can find the maximal paths in weighted, directed graphs on a one-dimensional lattice
inferred← citeshttps://doi.org/10.1109/istcs.1995.377035openalex-snapshot
Open combinatorial problems in computational molecular biology
inferred← citeshttps://doi.org/10.1109/micro50266.2020.00081openalex-snapshot
GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21965openalex-snapshot
Speeding up dynamic programming
inferred← citeshttps://doi.org/10.1126/scitranslmed.aao5931openalex-snapshot
Personalized cancer vaccine effectively mobilizes antitumor T cell immunity in ovarian cancer
inferred← citeshttps://doi.org/10.1137/0149012openalex-snapshot
Trees, Stars, and Multiple Biological Sequence Alignment
inferred← citeshttps://doi.org/10.1137/0149094openalex-snapshot
Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths
inferred← citeshttps://doi.org/10.1137/s0097539702402007openalex-snapshot
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
inferred← citeshttps://doi.org/10.1142/9789812702098_0032openalex-snapshot
ALIGNING SEQUENCES WITH NON-AFFINE GAP PENALTY: PLAINS ALGORITHM, A PRACTICAL IMPLEMENTATION, AND ITS BIOLOGICAL APPLICATIONS IN COMPARATIVE GENOMICS
inferred← citeshttps://doi.org/10.1142/9789812794840_0001openalex-snapshot
DYNAMIC PROGRAMMING STRATEGIES FOR ANALYZING BIOMOLECULAR SEQUENCES
inferred← citeshttps://doi.org/10.1145/146637.146650openalex-snapshot
Sparse dynamic programming I
inferred← citeshttps://doi.org/10.1145/146637.146656openalex-snapshot
Sparse dynamic programming II
inferred← citeshttps://doi.org/10.1145/167088.167132openalex-snapshot
A robust model for finding optimal evolutionary trees
inferred← citeshttps://doi.org/10.1145/3470496.3527436openalex-snapshot
SeGraM
inferred← citeshttps://doi.org/10.1145/59287.59290openalex-snapshot
Row replacement algorithms for screen editors
inferred← citeshttps://doi.org/10.1146/annurev.ps.43.020192.001125openalex-snapshot
Combinatorial Data Analysis
inferred← citeshttps://doi.org/10.1186/1471-2105-7-292openalex-snapshot
MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution
inferred← citeshttps://doi.org/10.1186/1471-2105-7-524openalex-snapshot
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise linear gap cost
inferred← citeshttps://doi.org/10.1186/1471-2105-7-527openalex-snapshot
Logarithmic gap costs decrease alignment accuracy
inferred← citeshttps://doi.org/10.1186/1748-7188-2-10openalex-snapshot
A basic analysis toolkit for biological sequences
inferred← citeshttps://doi.org/10.1186/1751-0473-9-12openalex-snapshot
Modular and configurable optimal sequence alignment software: Cola
inferred← citeshttps://doi.org/10.1186/1756-0500-6-25openalex-snapshot
Empirical assessment of sequencing errors for high throughput pyrosequencing data
inferred← citeshttps://doi.org/10.1186/s12859-016-0945-5openalex-snapshot
Characterization of multiple sequence alignment errors using complete-likelihood score and position-shift map
inferred← citeshttps://doi.org/10.1186/s12859-017-1665-1openalex-snapshot
Solving the master equation for Indels
inferred← citeshttps://doi.org/10.1214/105051605000000061openalex-snapshot
Summation test for gap penalties and strong law of the local alignment score
inferred← citeshttps://doi.org/10.1287/mnsc.37.8.909openalex-snapshot
A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
inferred← citeshttps://doi.org/10.1287/mnsc.41.5.874openalex-snapshot
Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
inferred← citeshttps://doi.org/10.1287/opre.49.6.839.10020openalex-snapshot
Near-Optimal Pricing and Replenishment Strategies for a Retail/Distribution System
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1000852openalex-snapshot
The Construction and Use of Log-Odds Substitution Scores for Multiple Sequence Alignment
inferred← citeshttps://doi.org/10.1504/ijbra.2014.062991openalex-snapshot
Searching for repeats, as an example of using the generalised Ruzzo-Tompa algorithm to find optimal subsequences with gaps
inferred← citeshttps://doi.org/10.4225/03/59c9f6db2a2d2openalex-snapshot
Algorithms for sequence alignment
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.904607openalex-snapshot
Alinhamento de sequências na avaliação de resultados de teste de robustez
inferred← citeshttps://doi.org/10.48550/arxiv.1703.00941openalex-snapshot
On the Fine-grained Complexity of One-Dimensional Dynamic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2111.01916openalex-snapshot
Accelerating Genome Sequence Analysis via Efficient Hardware/Algorithm Co-Design
inferred← citeshttps://doi.org/10.52202/062738-0172openalex-snapshot
Challenges of working with a large building energy database. Combining datasets from different scales
inferred← citeshttps://doi.org/10.5555/314464.314626openalex-snapshot
Reconstructing a history of recombinations from a set of sequences
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93965openalex-snapshot
Meta-alignment of biological sequences
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.