✦ LIBER ✦

Approximating minimum-length-sequence metrics: a cautionary note

✍ Scribed by Ralph P. Boland; Edward K. Brown; William H.E. Day

Book ID: 104180063
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 926 KB
Volume: 4
Category: Article
ISSN: 0165-4896
DOI: 10.1016/0165-4896(83)90028-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interpreting sequence motifs: a cautiona

Interpreting sequence motifs: a cautionary note

✍ Thomas Mikkelsen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 159 KB

A cautionary note on pathogen-derived se

A cautionary note on pathogen-derived sequences

✍ Lucioli, Alessandra; Sallustio, David E; Barboni, Daniele; Berardi, Alessandra; 📂 Article 📅 2008 🏛 Nature Publishing Group 🌐 English ⚖ 253 KB

A note on approximate systems of metric

A note on approximate systems of metric compacta

✍ S. Mardešić; L. Rubin; N. Uglešić 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A Constant Factor Approximation for Mini

A Constant Factor Approximation for Minimum -Edge-Connected -Subgraph with Metric Costs

✍ Safari, MohammadAli; Salavatipour, Mohammad R. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 445 KB

A cautionary note on switching mitochond

A cautionary note on switching mitochondrial DNA reference sequences in forensic genetics

✍ Antonio Salas; Michael Coble; Stijn Desmyter; Tomasz Grzybowski; Leonor Gusmão; 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 149 KB

A monotone iterative procedure to approx

A monotone iterative procedure to approximate trees of minimal length in metric spaces

✍ Dietmar Cieslik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Let \(N\) be a finite set of points in a metric space. The problem of "Shortest Connectivity" search a Steiner-Minimal-Tree (SMT) for \(N\), which is a tree interconnecting the points of \(N\) with shortest possible length. Here, we allow additional points (Steiner points) in the tree. In general, i