fast neighbor joining
play

Fast Neighbor Joining Jens Lagergren Isaac Elias Royal Institute - PowerPoint PPT Presentation

Oct 01, 2022 •388 likes •889 views

Fast Neighbor Joining Jens Lagergren Isaac Elias Royal Institute of Technology Sweden 1 Evolutionary History . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

  1. Fast Neighbor Joining Jens Lagergren Isaac Elias Royal Institute of Technology Sweden 1

  2. Evolutionary History . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ? . . . . . . . . ? . . . ? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chimp Gorilla Orangutan Human • Distance methods • Parsimony methods • ML methods 2

  3. Tree Reconstruction Problem Additive Metric Tree T D T ( x, y ) = � e ∈ path( x,y ) l ( e ) a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 . . . . . . . . d . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . a b c d . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . a 0 3 6 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . D T = c b b 0 5 5 c 0 2 d 0 3

  4. Tree Reconstruction Problem Additive Metric Tree T D T ( x, y ) = � e ∈ path( x,y ) l ( e ) a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 . . . . . . . . d . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . a b c d . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . a 0 3 6 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . D T = c b 0 5 5 b c 0 2 d 0 Input A non-additive metric D . a b c d a 0 3 5 6 Output Tree S , without edge D = b 0 4 5 lengths, that is closest to D , c 0 1 d 0 min D S | D S − D | ∞ . 3

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Algorithm Summary Method Input Output Neighbor Joining Distance matrix D T, B Distance

Algorithm Summary Method Input Output Neighbor Joining Distance matrix D T, B Distance

3/10/09 CSCI1950Z Computa3onal Methods for Biology Lecture 11 Ben Raphael March 2, 2009 hFp://cs.brown.edu/courses/csci1950z/ Algorithm Summary Method Input Output Neighbor Joining Distance matrix D T, B Distance based UPGMA

631 views • 13 slides
Fast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles Erich Schubert,

Fast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles Erich Schubert,

0 / 12 Fast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles Erich Schubert, Arthur Zimek, Hans-Peter Kriegel Lehr- und Forschungseinheit Datenbanksysteme Institut fr Informatik Ludwig-Maximilians-Universitt

711 views • 39 slides
Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes

Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes

Birn et al.: Nearest Neighbors 1 Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes Singler Birn et al.: Nearest Neighbors 2 2D Nearest Neighbor Search Preprocess S = { ( x 1 , y 1 ) , . . . , ( x

201 views • 19 slides
CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm

CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm

Nearest Neighbor CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm Note: Slides were adapted from David Sontag, New York University (who adapted them from Vibhav Gogate, Carlos Questrin, Mehryar

200 views • 16 slides
Scaling IPv6 Neighbor Discovery Ben Mack-Crane ( ben.mackcrane@huawei.com ) Overview of Neighbor

Scaling IPv6 Neighbor Discovery Ben Mack-Crane ( ben.mackcrane@huawei.com ) Overview of Neighbor

Scaling IPv6 Neighbor Discovery Ben Mack-Crane ( ben.mackcrane@huawei.com ) Overview of Neighbor Discovery Protocol IPv6 nodes on the same LAN use Neighbor Discovery (RFC4861) to to find routers and discover link and network parameters,

310 views • 10 slides
Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor

Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor

Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor classification The basic algorithm Different distance measures Some practical aspects Voronoi Diagrams and Decision Boundaries What is the

893 views • 57 slides
Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M.

Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M.

Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M. Magdon-Ismail CSCI 4100/6100 My 5-Year-Old Called It A ManoHorse The simplest method of learning that we know. Classify according to similar

331 views • 16 slides
Example Im at work, neighbor John calls to say my alarm is ringing, but neighbor Mary doesnt

Example Im at work, neighbor John calls to say my alarm is ringing, but neighbor Mary doesnt

Example Im at work, neighbor John calls to say my alarm is ringing, but neighbor Mary doesnt call. Sometimes its set o ff by minor earthquakes. Is there a burglar? Variables: Burglar , Earthquake , Alarm , JohnCalls , MaryCalls Network

849 views • 55 slides
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled

Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled

Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled Sepideh Mahabadi UIUC MIT Nearest Neighbor Problem Nearest Neighbor Dataset of points in a metric space (, ) , e.g.

967 views • 81 slides
BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch

BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch

BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch Tuesday, January 21, 2020 1 LOGISTICS LOGISTICS TAs and Office hours Monday: Mehrdad (TSRB 523a) - 2pm-3:15pm Tuesday: TJ (VL C449 Cubicle D) -

362 views • 12 slides
On Optimal Neighbor Discovery Philipp H. Kindt philipp.kindt@tum.de SIGCOMM19, Beijing CH

On Optimal Neighbor Discovery Philipp H. Kindt philipp.kindt@tum.de SIGCOMM19, Beijing CH

On Optimal Neighbor Discovery Philipp H. Kindt philipp.kindt@tum.de SIGCOMM19, Beijing CH 918/5-1 - Slotless Neighbor Discovery Neighbor Discovery in MANETs Pairwise Groupwise Pairwise in Groups Realizing Neighbor Discovery

747 views • 19 slides
High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who?

High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who?

High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who? About Cliqz and me What? Problem statement Why? Applications How? Exact solutions in low dimensions Approximate

690 views • 19 slides
NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule

NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule

NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule Consider a test point x. x is the closest point to x out of the rest of the test points. Nearest Neighbor Rule selects the class for x with the

573 views • 33 slides
Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg MIT Cornell Sepideh

Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg MIT Cornell Sepideh

Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg MIT Cornell Sepideh Mahabadi Yang Yuan MIT Cornell Nearest Neighbor Dataset of points in a metric space (, ) 6/17/2016 2 Nearest Neighbor

883 views • 69 slides
Nearest neighbor methods Lecture 11 David Sontag New York

Nearest neighbor methods Lecture 11 David Sontag New York

Nearest neighbor methods Lecture 11 David Sontag New York University Slides adapted from Vibhav Gogate, Carlos Guestrin, Mehryar Mohri, & Luke Zettlemoyer Nearest Neighbor Algorithm

311 views • 20 slides
Average - case Lower Bounds for Approximate Near - Neighbor fs om Isoperimetric Inequalities

Average - case Lower Bounds for Approximate Near - Neighbor fs om Isoperimetric Inequalities

Simple Average - case Lower Bounds for Approximate Near - Neighbor fs om Isoperimetric Inequalities Yitong Yin Nanjing University Nearest Neighbor Search ( NNS ) metric space ( X, dist) query x X database access y = ( y 1 , y 2 , . . . , y

384 views • 26 slides
Triplet and Quartet Distances Between Trees of Arbitrary Degree Gerth Stlting Brodal Rolf

Triplet and Quartet Distances Between Trees of Arbitrary Degree Gerth Stlting Brodal Rolf

Triplet and Quartet Distances Between Trees of Arbitrary Degree Gerth Stlting Brodal Rolf Fagerberg Aarhus University University of Southern Denmark Thomas Mailund, Christian N. S. Pedersen, Andreas Sand Aarhus University, Bioinformatics

429 views • 20 slides
Enhancing Traditional Databases to Support Broader Data Management Applications Yi Chen

Enhancing Traditional Databases to Support Broader Data Management Applications Yi Chen

Enhancing Traditional Databases to Support Broader Data Management Applications Yi Chen Computer Science & Engineering Arizona State University What Is a Database System? Of course, there are traditional relational database management

756 views • 41 slides
A quick review Significance of similarity scores (P-values) Empirical null score

A quick review Significance of similarity scores (P-values) Empirical null score

A quick review Significance of similarity scores (P-values) Empirical null score distribution Extreme value distribution Multiple-testing correction (Bonferroni) and E-values FROM THE ABSTRAT: P values and accompanying methods

683 views • 35 slides
DEPUTY Maarten de Vos, all the way from Holland. Maarten is PRINCIPAL putting the finishing

DEPUTY Maarten de Vos, all the way from Holland. Maarten is PRINCIPAL putting the finishing

Issue 12, Sept.15, 2006 Poverty is the worst form of violence Mahatma Mahatma Gandhi Gandhi WELCOME to newcomers, Kirsten de Bruin and DEPUTY Maarten de Vos, all the way from Holland. Maarten is PRINCIPAL putting the finishing

275 views • 4 slides
Note Well Any submission to the IETF intended by the

Note Well Any submission to the IETF intended by the

Note Well Any submission to the IETF intended by the Contributor for publica<on as all or part of an IETF Internet-Dra? or RFC and any

207 views • 9 slides
Training Deterministic Parsers with Non-Deterministic Oracles by Yoav Goldberg and Joakim

Training Deterministic Parsers with Non-Deterministic Oracles by Yoav Goldberg and Joakim

Training Deterministic Parsers with Non-Deterministic Oracles by Yoav Goldberg and Joakim Nivre, 2013 Seminarvortrag Pius Meinert July 13, 2018 Training Deterministic Parsers with Non-Deterministic Oracles root PRD SBJ DOBJ IOBJ

842 views • 47 slides
The periodicity theorem in the solution to the Arf-Kervaire invariant problem Harvard-MIT

The periodicity theorem in the solution to the Arf-Kervaire invariant problem Harvard-MIT

The periodicity theorem Mike Hill Mike Hopkins Doug Ravenel The periodicity theorem in the solution to the Arf-Kervaire invariant problem Harvard-MIT Summer Seminar Our strategy on the Kervaire Invariant The spectrum M The slice

1.46k views • 125 slides
Mixed Eect Models Danielle Quinn PhD Candidate, Memorial University Regression Modeling in R:

Mixed Eect Models Danielle Quinn PhD Candidate, Memorial University Regression Modeling in R:

Regression Modeling in R: Case Studies REGRESSION MODELING IN R : CASE STUDIES Mixed Eect Models Danielle Quinn PhD Candidate, Memorial University Regression Modeling in R: Case Studies Before you start modeling... Regression Modeling in R:

415 views • 29 slides

More recommend