On the public citation graph

Are all global alignment algorithms and implementations correct?

0 signed · 26 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.1006/jmbi.2000.4042openalex-snapshot
T-coffee: a novel method for fast and accurate multiple sequence alignment 1 1Edited by J. Thornton
inferredcites →https://doi.org/10.1007/bf01074755openalex-snapshot
Speech discrimination by dynamic programming
inferredcites →https://doi.org/10.1007/bf02462326openalex-snapshot
Optimal sequence alignment using affine gap costs
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/s0168-9525(00)02024-2openalex-snapshot
EMBOSS: The European Molecular Biology Open Software Suite
inferredcites →https://doi.org/10.1017/cbo9780511790492openalex-snapshot
Biological Sequence Analysis
inferredcites →https://doi.org/10.1038/srep01746openalex-snapshot
FOGSAA: Fast Optimal Global Sequence Alignment Algorithm
inferredcites →https://doi.org/10.1038/srep02619openalex-snapshot
A comparative assessment and analysis of 20 representative sequence alignment methods for protein structure prediction
inferredcites →https://doi.org/10.1073/pnas.69.1.4openalex-snapshot
Matching Sequences under Deletion/Insertion Constraints
inferredcites →https://doi.org/10.1093/bioinformatics/4.1.11openalex-snapshot
Optimal alignments in linear space
inferredcites →https://doi.org/10.1093/bioinformatics/btp163openalex-snapshot
Biopython: freely available Python tools for computational molecular biology and bioinformatics
inferredcites →https://doi.org/10.1093/nar/12.1part2.447openalex-snapshot
A fast homology program for aligning biological sequences
inferredcites →https://doi.org/10.1137/0126070openalex-snapshot
On the Theory and Computation of Evolutionary Distances
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/363958.363994openalex-snapshot
A technique for computer detection and correction of spelling errors
inferredcites →https://doi.org/10.1186/1471-2105-7-188openalex-snapshot
Bio++: a set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics
inferredcites →https://doi.org/10.1186/1471-2105-9-11openalex-snapshot
SeqAn An efficient, generic C++ library for sequence analysis
inferredcites →https://doi.org/10.2307/2534039openalex-snapshot
Introduction to Computational Biology: Maps, Sequences and Genomes.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/13836_2018_42openalex-snapshot
Population and Evolutionary Genetic Inferences in the Whole-Genome Era: Software Challenges
inferred← citeshttps://doi.org/10.1101/130633openalex-snapshot
Acceleration of Nucleotide Semi-Global Alignment with Adaptive Banded Dynamic Programming
inferred← citeshttps://doi.org/10.1109/bibm49941.2020.9313199openalex-snapshot
Homomorphic Computation of Local Alignment
inferred← citeshttps://doi.org/10.1134/s1995080226616802openalex-snapshot
Selecting Longest Common Subsequence while Avoiding Non-necessary Fragmentation as much as Possible
inferred← citeshttps://doi.org/10.1186/s12859-018-2014-8openalex-snapshot
Introducing difference recurrence relations for faster semi-global alignment of long sequences
inferred← citeshttps://doi.org/10.3390/genes13112005openalex-snapshot
Heuristic Pairwise Alignment in Database Environments
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.