Sponsorised links
This year
EasyRGB - Color mathematics and conversion formulas.
by JJL
& 4 others
formulas used by our Color Calculator.
Each conversion formula is written as a "neutral programming function", easy to be translate in any specific computer language (C, Java, Basic, Pascal, PHP, Perl etc.).
Coding Horror: Sorting for Humans : Natural Sort Order
by parmentierf
(via)
The default sort functions in almost every programming language are poorly suited for human consumption. What do I mean by that?
Sponsorised links
2007
Double Metaphone - Wikipédia
by parmentierf
(via)
Le Double Metaphone est un algorithme de recherche phonétique écrit par Lawrence Philips et est la deuxième génération de l'algorithme Metaphone. Son implémentation a été décrite en juin 2000 dans le magazine C/C Users Journal.
Il est appelé « Double » car il peut retourner un code primaire et secondaire pour une chaîne de caractères (String) ; cela compte pour des cas ambigus ou pour des variantes multiples avec des ascendances communes. Par exemple, l'encodage du nom « Smith » rapporte le code primaire SM0 et le code secondaire XMT, lorsque le nom « Schmidt » rapporte le code primaire XMT et le code secondaire de SMT ; les deux ont XMT en commun.
Francescu e Dume
by Francescu
& 1 other
(via)
Le blog de deux étudiants de l'université de Corse, traitant de programmation et de web 2.0.
2006
Mais qui est donc ce mystérieux Apothicaire ?
by enfoyrus
Vous êtes de plus en plus nombreux à chercher des détails sur ce singulier personnage. Un écrivain pas comme les autres. Un auteur qui se paie le luxe, après quatre mois sur internet, et en dépit d'un Page Rank encore modeste, de se retrouver en tête de Google, Yahoo ! et MSN pour des mots génériques (essayez " mots écrits " sur GG). Un vrai pied de nez aux mammouths des multinationales, rois du fric. Jouissif ! On ne le dira jamais assez : con . te . nus, voilà le secret. Algèbre des mots face au manque d'imagination des caciques pétris de graisse. Cette biographie, par exemple, ne pouvait qu'émaner d'un artiste...
Algorithms in Bioinformatics: SplitsTree4: Tübingen University
by parmentierf
& 1 other
(via)
SplitsTree4 is the leading application for computing evolutionary networks from molecular sequence data. Given an alignment of sequences, a distance matrix or a set of trees, the program will compute a phylogenetic tree or network using methods such as split decomposition, neighbor-net, consensus network, super networks methods or methods for computing hybridization or simple recombination networks.
SplitsTree4 is an all-new implementation of the SplitsTree3 software written in Java.
Algorithmes vectoriels et bioinformatique
by parmentierf
& 1 other
Thèse de doctorat de Sylvie Hamel - recherche approximative de chaînes de caractères.
Media & Tech
by br1o
Wikio: les algorithmes de promotion via les votes expliqués par l'équipe de développement
Dictionary of Algorithms and Data Structures
by parmentierf
& 11 others
(via)
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information. Index pages list entries by area and by type. The two-level index has a total download 1/20 as big as this page.
Tame the Beast by Matching Similar Strings
by parmentierf
I described the algorithms in two classes: equivalence methods and similarity ranking methods. Equivalence methods return a Boolean result, whereas the similarity ranking methods return a numeric similarity measure or distance metric. In information retrieval systems, it is possible to mix methods to produce a faster hybrid approach. A typical approach is to employ a two-pass mechanism in which an equivalence method is used by the database as a first pass filter, and a ranked similarity method is applied to the filtered entries for the second pass. Ranked similarity methods tend to be algorithmically more complex than equivalence methods, so are usually implemented as custom code outside of the database.
A Guided Tour to Approximate String Matching - Navarro (ResearchIndex)
by parmentierf
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities.
Indexed Approximate String Searching
by parmentierf
& 1 other
Une bonne présentation sur la recherche approximative de chaînes (références, algos, ...)
The Boyer-Moore Fast String Searching Algorithm
by parmentierf
Our algorithm has the peculiar property that, roughly speaking, the longer the pattern is, the faster the algorithm goes. Furthermore, the algorithm is ``sublinear'' in the sense that it generally looks at fewer characters than it passes. The algorithm is described in
Knuth-Morris-Pratt Algorithm
by parmentierf
& 1 other
The problem: given a (short) pattern and a (long) text, both strings, determine whether the pattern appears somewhere in the text. Last time we saw how to do this with finite automata. This time we'll go through the Knuth-Morris-Pratt (KMP) algorithm, which can be thought of as an efficient way to build these automata. I also have some working C source code which might help you understand the algorithm better.
