Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24280675

The neighbor-net algorithm

Author
LEVY, Dan1 2 ; PACHTER, Lior1 2
[1] Department of Mathematics and Computer Science, UC Berkeley, United States
[2] Department of Statistics, University of Oxford, United Kingdom
Source

Advances in applied mathematics (Print). 2011, Vol 47, Num 2, pp 240-258, 19 p ; ref : 47 ref

CODEN
AAPMEF
ISSN
0196-8858
Scientific domain
Mathematics
Publisher
Elsevier, San Diego, CA
Publication country
United States
Document type
Article
Language
English
Author keyword
05E99 62P10 68R05 92B10 92D15 Balanced length Circular decomposable metric Kalmanson conditions Minimum evolution Neighbor-joining Neighbor-net Splits network Traveling salesman problem
Keyword (fr)
Algorithme glouton Algorithme optimal Implémentation Mathématiques appliquées Méthode moindre carré Problème commis voyageur Relation ordre 05C05 Tessellation
Keyword (en)
Greedy algorithm Optimal algorithm Implementation Applied mathematics Least squares method Travelling salesman problem Ordering Tessellation
Keyword (es)
Algoritmo glotón Algoritmo óptimo Implementación Matemáticas aplicadas Método cuadrado menor Problema viajante comercio Relación orden
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory

Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis

Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02K General, history and biography / 001A02K01 General mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
24280675

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web