On the public citation graph

Approximation algorithms for tree alignment with a given phylogeny

https://doi.org/10.1007/bf01955679

0 signed · 90 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/net.3230220105openalex-snapshot

Steiner tree problems

inferredcites →https://doi.org/10.1007/bf01681346openalex-snapshot

Locating the vertices of a steiner tree in an arbitrary metric space

inferredcites →https://doi.org/10.1007/bf01732471openalex-snapshot

Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA

inferredcites →https://doi.org/10.1007/bf01739097openalex-snapshot

Criteria for optimising phylogenetic trees and the problem of determining the root of a tree

inferredcites →https://doi.org/10.1007/bf02459504openalex-snapshot

Line geometries for sequence comparisons

inferredcites →https://doi.org/10.1007/bf02459635openalex-snapshot

A survey of multiple sequence comparison methods

inferredcites →https://doi.org/10.1007/bf02460299openalex-snapshot

Efficient methods for multiple sequence alignment with guaranteed error bounds

inferredcites →https://doi.org/10.1016/0020-0190(89)90039-2openalex-snapshot

The Steiner problem with edge lengths 1 and 2

inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot

Optimization, approximation, and complexity classes

inferredcites →https://doi.org/10.1016/0196-6774(92)90050-mopenalex-snapshot

The shortest network under a given topology

inferredcites →https://doi.org/10.1089/cmb.1994.1.337openalex-snapshot

On the Complexity of Multiple Sequence Alignment

inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040454openalex-snapshot

The neighbor-joining method: a new method for reconstructing phylogenetic trees.

inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040577openalex-snapshot

A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given.

inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040578openalex-snapshot

A tree reconstruction method that is economical in the number of pairwise comparisons used.

inferredcites →https://doi.org/10.1093/sysbio/19.1.83openalex-snapshot

Methods for Computing Wagner Trees

inferredcites →https://doi.org/10.1109/sfcs.1991.185402openalex-snapshot

On better heuristic for Euclidean Steiner minimum trees

inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot

Proof verification and hardness of approximation problems

inferredcites →https://doi.org/10.1137/0128004openalex-snapshot

Minimal Mutation Trees of Sequences

inferredcites →https://doi.org/10.1137/0148063openalex-snapshot

The Multiple Sequence Alignment Problem in Biology

inferredcites →https://doi.org/10.1137/0149012openalex-snapshot

Trees, Stars, and Multiple Biological Sequence Alignment

inferredcites →https://doi.org/10.1145/125490.125491openalex-snapshot

Mapping and interpreting biological information

inferredcites →https://doi.org/10.1145/167088.167170openalex-snapshot

Mapping the genome

inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot

Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane

inferredcites →https://doi.org/10.2307/2412028openalex-snapshot

Methods for Computing Wagner Trees

inferredcites →https://doi.org/10.2307/2532117openalex-snapshot

Mathematical Methods for DNA Sequences.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w1608openalex-snapshot

Biology Computing

inferred← citeshttps://doi.org/10.1002/9780470050118.ecse932openalex-snapshot

Biology Computing

inferred← citeshttps://doi.org/10.1002/9781118301081.biblioopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1006/jagm.1997.0882openalex-snapshot

Improved Approximation Algorithms for Tree Alignment

inferred← citeshttps://doi.org/10.1007/11732990_23openalex-snapshot

Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes

inferred← citeshttps://doi.org/10.1007/11751595_67openalex-snapshot

The Bottleneck Tree Alignment Problems

inferred← citeshttps://doi.org/10.1007/3-540-44888-8_23openalex-snapshot

Complexities of the Centre and Median String Problems

inferred← citeshttps://doi.org/10.1007/3-540-45692-9_2openalex-snapshot

On the design of optimization criteria for multiple sequence alignment

inferred← citeshttps://doi.org/10.1007/3-540-45784-4_8openalex-snapshot

Efficient Methods for Inferring Tandem Duplication History

inferred← citeshttps://doi.org/10.1007/3-540-48481-7_38openalex-snapshot

A Decomposition Theorem for MaximumWeight Bipartite Matchings with Applications to Evolutionary Trees

inferred← citeshttps://doi.org/10.1007/3-540-61258-0_17openalex-snapshot

Improved approximation algorithms for tree alignment

inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot

Tree contractions and evolutionary trees

inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_18openalex-snapshot

A Survey of Graph Mining Techniques for Biological Datasets

inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_60openalex-snapshot

Partition in High Dimensional Spaces

inferred← citeshttps://doi.org/10.1007/978-1-4471-5298-9_6openalex-snapshot

Large-Scale Multiple Sequence Alignment and Phylogeny Estimation

inferred← citeshttps://doi.org/10.1007/978-1-4614-1701-9openalex-snapshot

Design and Analysis of Approximation Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_60-1openalex-snapshot

Partition in High-Dimensional Spaces

inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_4openalex-snapshot

Computing Shortest Networks with Fixed Topologies

inferred← citeshttps://doi.org/10.1007/978-3-031-10596-8_9openalex-snapshot

Restriction and Steiner Tree

inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_37openalex-snapshot

Settling the Intractability of Multiple Alignment

inferred← citeshttps://doi.org/10.1007/978-3-540-30133-2_168openalex-snapshot

Design the Hardware of Genetic Algorithm for TSP and MSA

inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_30openalex-snapshot

A Large Version of the Small Parsimony Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-12683-3_24openalex-snapshot

Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny

inferred← citeshttps://doi.org/10.1007/bfb0030789openalex-snapshot

Fixed topology alignment with recombination

inferred← citeshttps://doi.org/10.1007/s00453-008-9209-8openalex-snapshot

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats

inferred← citeshttps://doi.org/10.1007/s00500-022-06790-wopenalex-snapshot

Developing new genetic algorithm based on integer programming for multiple sequence alignment

inferred← citeshttps://doi.org/10.1007/s11390-010-9304-6openalex-snapshot

Some Algorithmic Challenges in Genome-Wide Ortholog Assignment

inferred← citeshttps://doi.org/10.1016/j.dam.2008.10.009openalex-snapshot

Approximation algorithms for constrained generalized tree alignment problem

inferred← citeshttps://doi.org/10.1016/j.ins.2010.02.008openalex-snapshot

On the bottleneck tree alignment problems

inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.012openalex-snapshot

Near optimal multiple alignment within a band in polynomial time

inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.015openalex-snapshot

Hardness results for the center and median string problems under the weighted and unweighted edit distances

inferred← citeshttps://doi.org/10.1016/j.spa.2012.08.004openalex-snapshot

Global alignment of molecular sequences via ancestral state reconstruction

inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00006-5openalex-snapshot

Methods for reconstructing the history of tandem repeats and their application to the human genome

inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00196-7openalex-snapshot

Fixed topology alignment with recombination

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00240-5openalex-snapshot

Topology of strings: Median string is NP-complete

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00028-6openalex-snapshot

A few logs suffice to build (almost) all trees: Part II

inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00011-xopenalex-snapshot

The consensus string problem for a metric is NP-complete

inferred← citeshttps://doi.org/10.1089/10665270050081513openalex-snapshot

Evaluation Measures of Multiple Sequence Alignments

inferred← citeshttps://doi.org/10.1089/cmb.1998.5.391openalex-snapshot

Better Methods for Solving Parsimony and Compatibility

inferred← citeshttps://doi.org/10.1089/cmb.2006.0101openalex-snapshot

Reconstruction of Ancestral Genomic Sequences Using Likelihood

inferred← citeshttps://doi.org/10.1089/cmb.2006.13.1323openalex-snapshot

Settling the Intractability of Multiple Alignment

inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199297306.003.0006openalex-snapshot

Parsimony and the problem of inapplicables in sequence data

inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199297306.003.0008openalex-snapshot

Parsimony and Bayesian phylogenetics

inferred← citeshttps://doi.org/10.1093/bioinformatics/18.11.1494openalex-snapshot

A simulated annealing algorithm for finding consensus sequences

inferred← citeshttps://doi.org/10.1101/854786openalex-snapshot

Binary integer programming for Multiple Sequence Alignment

inferred← citeshttps://doi.org/10.1109/spire.1999.796584openalex-snapshot

Near optimal multiple sequence alignments using a traveling salesman problem approach

inferred← citeshttps://doi.org/10.1109/tcbb.2008.122openalex-snapshot

Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats

inferred← citeshttps://doi.org/10.1111/j.1096-0031.2009.00282.xopenalex-snapshot

POY version 4: phylogenetic analysis using dynamic homologies

inferred← citeshttps://doi.org/10.1111/j.1096-0031.2010.00318.xopenalex-snapshot

Phylogenetic morphometrics (II): algorithms for landmark optimization

inferred← citeshttps://doi.org/10.1137/1.9781611973068.114openalex-snapshot

Packing multiway cuts in capacitated graphs

inferred← citeshttps://doi.org/10.1137/100797473openalex-snapshot

Near Optimal Bounds for Steiner Trees in the Hypercube

inferred← citeshttps://doi.org/10.1137/s0097539797332275openalex-snapshot

Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees

inferred← citeshttps://doi.org/10.1142/s012905410400239xopenalex-snapshot

A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION

inferred← citeshttps://doi.org/10.1142/s0219720003000095openalex-snapshot

Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment

inferred← citeshttps://doi.org/10.1145/258533.258550openalex-snapshot

General techniques for comparing unrooted evolutionary trees

inferred← citeshttps://doi.org/10.1145/267521.267890openalex-snapshot

A more efficient approximation scheme for tree alignment

inferred← citeshttps://doi.org/10.1145/279069.279081openalex-snapshot

Better methods for solving parsimony and compatibility

inferred← citeshttps://doi.org/10.1145/335305.335354openalex-snapshot

Near optimal multiple alignment within a band in polynomial time

inferred← citeshttps://doi.org/10.1145/369133.369241openalex-snapshot

Zinc finger gene clusters and tandem gene duplication

inferred← citeshttps://doi.org/10.1186/1471-2105-13-293openalex-snapshot

The tree alignment problem

inferred← citeshttps://doi.org/10.1186/s12864-015-2297-3openalex-snapshot

A maximum-likelihood approach for building cell-type trees by lifting

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101030openalex-snapshot

Tree Contractions and Evolutionary Trees

inferred← citeshttps://doi.org/10.5555/1496770.1496884openalex-snapshot

Packing multiway cuts in capacitated graphs

inferred← citeshttps://doi.org/10.6100/ir639768openalex-snapshot

Information extraction from the web using a search engine

inferred← citeshttps://doi.org/10.82444/warw.33642094openalex-snapshot

Learning and approximation algorithms for problems motivated by evolutionary trees

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.