Concept

Neighbour joining

Publications associées (10)

Sketches, metrics and fast algorithms

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

Taxonomic revision of the Eudicella White, 1839 complex, with description of three new subgenera

Michele De Palma

Morphological and DNA barcoding analysis of representative taxa in the Eudicella White complex identified five distinct subgenera, three of which are established herein: Eudicella (Coelorrhinella) n. subg., Eudicella (Aneurhina) n. subg., and Eudicella (Ce ...

2021

On Application Of Non-Negative Matrix Factorization for Ad Hoc Microphone Array Calibration from Incomplete Noisy Distances

Hervé Bourlard, Afsaneh Asaei, Mohammadjavad Taghizadeh

We propose to use non-negative matrix factorization (NMF) to estimate the unknown pairwise distances and reconstruct a distance matrix for microphone array position calibration. We develop new multiplicative update rules for NMF with incomplete input matri ...

2015

PDB-Explorer: a web-based interactive map of the protein data bank in shape space

Luc Patiny, Daniel Kostro, Michaël Giuseppe Zasso, Jean-Louis Reymond

Background: The RCSB Protein Data Bank (PDB) provides public access to experimentally determined 3D-structures of biological macromolecules (proteins, peptides and nucleic acids). While various tools are available to explore the PDB, options to access the ...

Biomed Central Ltd2015

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

A metric for phylogenetic trees based on matching

Bernard Moret, Yu Lin, Vaibhav Rajan

Comparing two or more phylogenetic trees is a fundamental task in computational biology. The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity, or distance. A large number of such measures have been proposed, but so t ...

Springer Verlag2011

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Pascal Fua, Engin Türetken, Germán González Serrano

We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ours builds a set of candidate trees over many different subsets ...

Humana Press2011

Mobile museum guide based on fast SIFT recognition

Effrosyni Kokiopoulou, Boris Ruf

This article explores the feasibility of a market-ready, mo- bile pattern recognition system based on the latest findings in the field of object recognition and currently available hardware and network technology. More precisely, an innovative, mobile muse ...

Springer2008

Phylogenetic networks: modeling, reconstructibility, and accuracy

Bernard Moret, Tandy Warnow

Phylogenetic networks model the evolutionary history of sets of organisms when events such as hybrid speciation and horizontal gene transfer occur. In spite of their widely acknowledged importance in evolutionary biology, phylogenetic networks have so far ...

2004

New approaches for reconstructing phylogenies from gene-order data

Bernard Moret, Tandy Warnow

We report on new techniques we have developed for reconstructing phylogenies on whole genomes. Our mathematical techniques include new polynomial-time methods for bounding the inversion length of a candidate tree and new polynomial-time methods for estimat ...

2001

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search