Mass spectrometry-based proteomics, Nature, vol.1, issue.6928, pp.198-207, 2003. ,
DOI : 10.1016/S0960-9822(01)00632-7
Numerical continuation methods, 1990. ,
DOI : 10.1007/978-3-642-61257-2
A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, pp.522-525, 1993. ,
DOI : 10.1109/34.211474
Graph edit distance with node splitting and merging, and its application to diatom idenfication, GbRPR, pp.95-106, 2003. ,
A Multivariate Approach to Investigate Docking Parameters' Effects on Docking Performance, Journal of Chemical Information and Modeling, vol.47, issue.4, pp.1673-1687, 2007. ,
DOI : 10.1021/ci6005596
A new bound for the quadratic assignment problem based on convex quadratic programming, Mathematical Programming, vol.89, issue.3, pp.341-357, 2001. ,
DOI : 10.1007/PL00011402
Concorde tsp solver, 2005. ,
Systematic identification of functional orthologs based on protein network comparison, Genome Research, vol.16, issue.3, pp.428-435, 2006. ,
DOI : 10.1101/gr.4526006
Shape matching and object recognition using shape contexts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.4, pp.509-522, 2002. ,
DOI : 10.1109/34.993558
Cross-species analysis of biological networks by Bayesian alignment, Proc. Natl. Acad. Sci. USA, pp.10967-10972, 2006. ,
DOI : 10.1073/pnas.0602294103
A Graph Edit Distance Based on Node Merging ,
DOI : 10.1007/978-3-540-27814-6_55
Nonlinear programming, Athena Scientific, 1999. ,
3D Shape Matching through Topological Structures, Discrete Geometry for Computer Imagery, pp.194-203, 2004. ,
DOI : 10.1007/978-3-540-39966-7_18
Graph theory 1736-1936, 1976. ,
Visual Reconstruction, 1987. ,
Graph theory with applications, 1976. ,
DOI : 10.1007/978-1-349-03521-2
Principal warps: thin-plate splines and the decomposition of deformations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, issue.6, pp.567-585, 1989. ,
DOI : 10.1109/34.24792
Convex Analysis and Nonlinear Optimization, 2000. ,
Molecular recognition by induced fit: how fit is the concept?, News Physiol Sci, vol.16, pp.171-173, 2001. ,
Convex Optimization, 2004. ,
Inparanoid: a comprehensive database of eukaryothic orthologs, Nucleic Acids Res, vol.33, 2005. ,
Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983. ,
DOI : 10.1016/0167-8655(83)90033-8
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem, Journal of Heuristics, vol.10, issue.5, pp.483-506, 2004. ,
DOI : 10.1023/B:HEUR.0000045321.59202.52
An eigenspace projection clustering method for inexact graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.4, pp.515-519, 2004. ,
DOI : 10.1109/TPAMI.2004.1265866
Spectral correspondence for point pattern matching, Pattern Recognition, vol.36, issue.1, pp.193-204, 2003. ,
DOI : 10.1016/S0031-3203(02)00054-7
On the theory of the analytical forms called threes, Philos. Mag, vol.37, issue.18, pp.374-378, 1859. ,
On the mathematical theory of isomers, Philos. Mag, vol.10, issue.47, pp.444-446, 1874. ,
DOI : 10.1017/CBO9780511703751.032
On the theory of the analytical forms called threes, with application to the theory of chemical combinations, Rep. Brit. Assoc. Sci, vol.4, issue.45, pp.257-305 ,
On the number of univalent radicals c n h 2n+1, Philos. Mag, vol.18, issue.3, pp.34-35, 1877. ,
Qaudratuc assignment problem library, 2007. ,
Spectral graph theory, volume 92 of CBMS Regional Conference Series, 1997. ,
Binary Forms of Alternate Variables, Proceedings of the London Mathematical Society, vol.1, issue.1, pp.277-286, 1878. ,
DOI : 10.1112/plms/s1-10.1.214
Notes on Quantics of Alternate Numbers, used as a means for determining the Invariants and Covariants of Quantics in general, Proc. London Math. Soc, pp.258-265, 1878. ,
DOI : 10.1112/plms/s1-10.1.124
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004. ,
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706
An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model, Proceedings of 13th International Conference on Pattern Recognition, p.180, 1996. ,
DOI : 10.1109/ICPR.1996.546934
Performance evaluation of the VF graph matching algorithm, Proceedings 10th International Conference on Image Analysis and Processing, p.1172, 1999. ,
DOI : 10.1109/ICIAP.1999.797762
An improved algorithm for matching large graphs, In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Cuen, pp.149-159, 2001. ,
Balanced graph matching, Advanced in Neural Information Processing Systems, 2006. ,
The Poisson Index: a new probabilistic model for protein ligand binding site similarity, Bioinformatics, vol.23, issue.22, pp.3001-3008, 2007. ,
DOI : 10.1093/bioinformatics/btm470
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, 1998. ,
DOI : 10.1017/CBO9780511790492
A novel genetic system to detect protein???protein interactions, Nature, vol.340, issue.6230, pp.245-246, 1989. ,
DOI : 10.1038/340245a0
Graph-based handwritten digit string recognition, Proceedings of 3rd International Conference on Document Analysis and Recognition, p.845, 1995. ,
DOI : 10.1109/ICDAR.1995.602033
Graemlin: General and robust alignment of multiple large interaction networks, Genome Research, vol.16, issue.9, pp.1169-1181, 2006. ,
DOI : 10.1101/gr.5235706
The graph isomorphism problem, 1996. ,
An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956. ,
DOI : 10.1002/nav.3800030109
Computer and intractability: A guide to the theory of NP-completeness, 1979. ,
Multi-Instance Kernels, Proceedings of the Nineteenth International Conference on Machine Learning, pp.179-186, 2002. ,
Chemical Information in 3D Space, Journal of Chemical Information and Computer Sciences, vol.36, issue.5, pp.1030-1037, 1996. ,
DOI : 10.1021/ci960343+
Further annotated bibliography on the isomorphism disease, Journal of Graph Theory, vol.9, issue.2, pp.95-109, 1979. ,
DOI : 10.1002/jgt.3190030202
Fast and optimal decoding for machine translation, Proceedings of ACL 39, pp.228-235, 2001. ,
DOI : 10.1016/j.artint.2003.06.001
URL : http://doi.org/10.1016/j.artint.2003.06.001
A method for localizing ligand binding pockets in protein structures, Proteins: Structure, Function, and Bioinformatics, vol.340, issue.10, pp.479-488, 2006. ,
DOI : 10.1002/prot.20769
Algebraic graph theory, 2000. ,
DOI : 10.1007/978-1-4613-0163-9
SitesBase: a database for structure-based protein-ligand binding site comparisons, Nucleic Acids Research, vol.34, issue.90001, pp.231-234, 2006. ,
DOI : 10.1093/nar/gkj062
A graduated assignment algorithm for graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.4 ,
DOI : 10.1109/34.491619
A fortran iv quasi decision algorithm for the pequivalence of two matrices. Calcolo, pp.17-35, 1957. ,
Travelling salesman and related problems, Handbook of Graph Theory, 2003. ,
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem, NICSO 2007, pp.199-210, 2008. ,
DOI : 10.1007/978-3-540-78987-1_19
Exponential and geometric kernels for graphs, In Mach. Learn, pp.146-163, 2002. ,
Convolution Kernels on Discrete Structures, 1999. ,
Design of the moses decoder for statistical machine translation, Software Engineering, Testing, and Quality Assurance for Natural Language Processing on, SETQA-NLP '08, pp.58-65, 2008. ,
DOI : 10.3115/1622110.1622120
Three-dimensional shape searching: state-of-the-art review and future trends, Computer-Aided Design, vol.37, issue.5, pp.509-530, 2005. ,
DOI : 10.1016/j.cad.2004.07.002
Experimental Analysis of Heuristics for the ATSP, The Travelling Salesman Problem and Its Variations, pp.445-487, 2002. ,
DOI : 10.1007/0-306-48213-4_10
Shape Variation in Protein Binding Pockets and their Ligands, Journal of Molecular Biology, vol.368, issue.1, pp.283-301, 2007. ,
DOI : 10.1016/j.jmb.2007.01.086
Document image decoding by heuristic search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.9, pp.945-950, 1996. ,
DOI : 10.1109/34.537350
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.1150
Marginalized Kernels between Labeled Graphs, Proceedings of the Twentieth International Conference on Machine Learning, pp.321-328, 2003. ,
Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proc. Natl. Acad. Sci. USA, pp.10011394-11399, 2003. ,
DOI : 10.1073/pnas.1534710100
PathBLAST: a tool for alignment of protein interaction networks, Nucleic Acids Research, vol.32, issue.Web Server, pp.83-88, 2004. ,
DOI : 10.1093/nar/gkh411
Many-to-many graph matching via metric embedding, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings., pp.850-857, 2003. ,
DOI : 10.1109/CVPR.2003.1211441
Decoding complexity in word-replacement translation models, Computational Linguistics, vol.25, pp.607-615, 1999. ,
Statistical phrase-based translation, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology , NAACL '03, pp.48-54, 2003. ,
DOI : 10.3115/1073445.1073462
The skew spectrum of graphs, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.496-503, 2008. ,
DOI : 10.1145/1390156.1390219
A kernel between sets of vectors, International Conference on Machine Learning, 2003. ,
The graphlet spectrum, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.529-536, 2009. ,
DOI : 10.1145/1553374.1553443
The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955. ,
DOI : 10.1002/nav.3800020109
Homology modelling of protein-protein complexes: a simple method and its possibilities and limitations, BMC Bioinformatics, vol.9, issue.1, p.427, 2008. ,
DOI : 10.1186/1471-2105-9-427
URL : https://hal.archives-ouvertes.fr/inria-00338202
Q-SiteFinder: an energy-based method for the prediction of protein-ligand binding sites, Bioinformatics, vol.21, issue.9, pp.1908-1916, 2005. ,
DOI : 10.1093/bioinformatics/bti315
Prediction of Protein???Ligand Interactions. Docking and Scoring:?? Successes and Gaps, Journal of Medicinal Chemistry, vol.49, issue.20, pp.5851-5855, 2006. ,
DOI : 10.1021/jm060999m
An oscillatory elastic graph matching model for recognition of offline handwritten Chinese characters, 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410), pp.284-287, 1999. ,
DOI : 10.1109/KES.1999.820179
A spectral technique for correspondence problems using pairwise constraints, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, pp.1482-1489, 2005. ,
DOI : 10.1109/ICCV.2005.20
Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features, 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007. ,
DOI : 10.1109/CVPR.2007.383091
Statistical machine translation, ACM Computing Surveys, vol.40, issue.3, pp.1-49, 2008. ,
DOI : 10.1145/1380584.1380586
Isomerism and Configuration, The Journal of Physical Chemistry, vol.33, issue.7, pp.1027-1079, 1929. ,
DOI : 10.1021/j150301a009
Alignment and Correspondence Using Singular Value Decomposition, Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition, pp.226-235, 2000. ,
DOI : 10.1007/3-540-44522-6_24
Extensions of marginalized graph kernels, Twenty-first international conference on Machine learning , ICML '04, pp.552-559, 2004. ,
DOI : 10.1145/1015330.1015446
Gaussian docking functions, Biopolymers, vol.112, issue.1, pp.76-90, 2003. ,
DOI : 10.1002/bip.10207
Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem, Operations Research, vol.31, issue.2, pp.277-291, 1983. ,
DOI : 10.1287/opre.31.2.277
Topology from the Differentiable Viewpoint, 1969. ,
Real spherical harmonic expansion coefficients as 3D shape descriptors for protein binding pocket and ligand comparisons, Bioinformatics, vol.21, issue.10, pp.2347-2355, 2005. ,
DOI : 10.1093/bioinformatics/bti337
Detection of 3D atomic similarities and their use in the discrimination of small molecule protein-binding sites, Bioinformatics, vol.24, issue.16, pp.105-111, 2008. ,
DOI : 10.1093/bioinformatics/btn263
Bridging the Gap Between Graph Edit Distance and Kernel Machines, World Scientific, vol.68, 2007. ,
DOI : 10.1142/6523
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Lecture Notes in Computer Science, vol.4109, pp.163-172, 2006. ,
DOI : 10.1007/11815921_17
Random graphs with arbitrary degree distributions and their applications, Physical Review E, vol.64, issue.2, p.26118, 2001. ,
DOI : 10.1103/PhysRevE.64.026118
URL : http://arxiv.org/abs/cond-mat/0007235
Oechem, version 1.3.4, openeye scientific software. website, 2005. ,
An Efficient Transformation Of The Generalized Traveling Salesman Problem, INFOR: Information Systems and Operational Research, vol.31, issue.1, pp.39-44, 1993. ,
DOI : 10.1080/03155986.1993.11732212
Efficient 3D shape matching and retrieval using a concrete radialized spherical projection representation, Pattern Recognition, vol.40, issue.9, pp.2437-2452, 2007. ,
DOI : 10.1016/j.patcog.2006.12.026
URL : https://hal.archives-ouvertes.fr/hal-00758964
BLEU, Proceedings of the 40th Annual Meeting on Association for Computational Linguistics , ACL '02, 2001. ,
DOI : 10.3115/1073083.1073135
A Parallel Grasp Implementation for the Quadratic Assignment Problem, Parallel Algorithms for Irregularly Structured Problems, pp.111-130, 1995. ,
DOI : 10.1007/978-1-4757-6130-6_6
Algebraische berechnung der anzhal der isomeren einiger organischer verbindungen, Z. Kristal, vol.93, pp.415-443, 1936. ,
<title>Adding linguistic constraints to document image decoding: comparing the iterated complete path and stack algorithms</title>, Document Recognition and Retrieval VIII, p.187, 2001. ,
DOI : 10.1117/12.410844
A lagrangian relaxation network for graph matching, IEEE Trans. Neural Networks, pp.4629-4634, 1996. ,
A Fast Flexible Docking Method using an Incremental Construction Algorithm, Journal of Molecular Biology, vol.261, issue.3, pp.470-489, 1996. ,
DOI : 10.1006/jmbi.1996.0477
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.7748
Finding Chemical Records by Digital Computers, Science, vol.126, issue.3278, p.814, 1957. ,
DOI : 10.1126/science.126.3278.814
The graph isomorphism disease, Journal of Graph Theory, vol.7, issue.4, pp.339-363, 1977. ,
DOI : 10.1002/jgt.3190010410
The Theory of Group-Reduced Distributions, American Journal of Mathematics, vol.49, issue.3, pp.433-455, 1927. ,
DOI : 10.2307/2370675
Automatic clustering of orthologs and in-paralogs from pairwise species comparisons, Journal of Molecular Biology, vol.314, issue.5, pp.1041-1052, 2001. ,
DOI : 10.1006/jmbi.2000.5197
Convex Analysis, 1970. ,
DOI : 10.1515/9781400873173
On the data base etl9b of handprinted characters in jis chinese characters and its analysis, IEICE Trans, p.68, 1985. ,
3D Model Retrieval with Spherical Harmonics and Moments, Proceedings of the 23rd DAGM-Symposium on Pattern Recognition, pp.392-397, 2001. ,
DOI : 10.1007/3-540-45404-7_52
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.1318
A simple and fuzzy method to align and compare druggable ligand-binding sites, Proteins: Structure, Function, and Bioinformatics, vol.8, issue.Suppl 4, pp.1755-1778, 2008. ,
DOI : 10.1002/prot.21858
URL : https://hal.archives-ouvertes.fr/hal-00620777
Probabilistic Subgraph Matching Based on Convex Relaxation, EMMCVPR05, pp.171-186, 2005. ,
DOI : 10.1007/11585978_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.1017
Evaluation of Convex Optimization Techniques for the Weighted Graph-Matching Problem in Computer Vision, Proceedings of the 23rd DAGM-Symposium on Pattern Recognition, pp.361-368, 2001. ,
DOI : 10.1007/3-540-45404-7_48
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices, Journal of the ACM, vol.23, issue.3, pp.433-445, 1976. ,
DOI : 10.1145/321958.321963
Kernel principal component analysis ,
DOI : 10.1007/BFb0020217
The GROMOS Biomolecular Simulation Program Package, The Journal of Physical Chemistry A, vol.103, issue.19 ,
DOI : 10.1021/jp984217f
Feature-based correspondence: an eigenvector approach, Image and Vision Computing, vol.10, issue.5, pp.283-288, 1992. ,
DOI : 10.1016/0262-8856(92)90043-3
Conserved patterns of protein interaction in multiple species ,
MultiBind and MAPPIS: webservers for multiple alignment of protein 3D-binding sites and their interactions, Nucleic Acids Research, vol.36, issue.Web Server, pp.260-264, 2008. ,
DOI : 10.1093/nar/gkn185
Global alignment of multiple protein interaction networks with application to functional orthology detection, Proc. Natl. Acad. Sci. USA, pp.12763-12768, 2008. ,
DOI : 10.1073/pnas.0806627105
Phylogenomic inference of protein molecular function: advances and challenges, Bioinformatics, vol.20, issue.2, pp.170-179, 2004. ,
DOI : 10.1093/bioinformatics/bth021
A Graph-Theoretic Algorithm for Matching Chemical Structures., Journal of Chemical Documentation, vol.5, issue.1, pp.36-43, 1963. ,
DOI : 10.1021/c160016a007
The Plasmodium protein network diverges from those of other eukaryotes, Nature, vol.32, issue.7064, pp.108-112, 2005. ,
DOI : 10.1038/nature04135
Chemistry and Algebra, Nature, vol.17, issue.432, p.1878 ,
DOI : 10.1038/017284a0
Protein Structure Comparison Using Bipartite Graph Matching and Its Application to Protein Structure Classification, Molecular & Cellular Proteomics, vol.1, issue.4, pp.334-339, 2002. ,
DOI : 10.1074/mcp.T200001-MCP200
Efficient dynamic programming search algorithms for phrase-based SMT, Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, CHSLP '06, 2006. ,
DOI : 10.3115/1631828.1631830
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.3946
Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation, Computational Linguistics, vol.25, issue.4, pp.97-133, 2003. ,
DOI : 10.1109/89.817451
URL : http://doi.org/10.1162/089120103321337458
Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.9, issue.12, pp.757-768, 1979. ,
DOI : 10.1109/TSMC.1979.4310127
An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976. ,
DOI : 10.1145/321921.321925
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.7741
An eigendecomposition approach to weighted graph matching problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.10, issue.5 ,
DOI : 10.1109/34.6778
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Transactions on Information Theory, vol.13, issue.2, pp.260-269, 1973. ,
DOI : 10.1109/TIT.1967.1054010
Detection of the median axis of vessels in retinal images, European Journal of Ophthalmology, vol.13, issue.2, 2003. ,
Correspondence matching using kernel principal components analysis and label consistency constraints, Pattern Recognition, vol.39, issue.6, pp.1012-1025, 2006. ,
DOI : 10.1016/j.patcog.2005.05.013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.1712
A bipartite graph matching framework for finding correspondences between structural elements in two proteins, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2004. ,
DOI : 10.1109/IEMBS.2004.1403843
A Critical Assessment of Docking Programs and Scoring Functions, Journal of Medicinal Chemistry, vol.49, issue.20, pp.495912-5931, 2006. ,
DOI : 10.1021/jm050362n
Multiple Graph Alignment for the Structural Analysis of Protein Active Sites, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.2, pp.310-320, 2007. ,
DOI : 10.1109/TCBB.2007.358301
Non-separable and planar graphs, Proc. Natl. Acad. Sci, pp.415-443, 1930. ,
DOI : 10.1007/978-1-4612-2972-8_3
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1076008
Congruent Graphs and the Connectivity of Graphs, American Journal of Mathematics, vol.54, issue.1, pp.150-168, 1932. ,
DOI : 10.2307/2371086
Travelling Salesman Problem ? Wikipedia, The Free Encyclopedia [Online; accessed 5, 2009. ,
From chemical documentation to chemoinformatics: 50 years of chemical information science, Journal of Information Science, vol.1, issue.11, pp.477-499, 2008. ,
DOI : 10.1177/0165551507084631
Implementation of nearest-neighbor searching in an online chemical structure search system, Journal of Chemical Information and Modeling, vol.26, issue.1, pp.36-41, 1986. ,
DOI : 10.1021/ci00049a008
A pca approach for fast retrieval of structural patterns in attributed graphs, 1994. ,
Improved network-based identification of protein orthologs, Bioinformatics, vol.24, issue.16, pp.200-206, 2008. ,
DOI : 10.1093/bioinformatics/btn277
GRAPHM: Graph matching package, 2008. ,
A Path Following Algorithm for Graph Matching, Image and Signal Processing Proceedings of the 3rd International Conference, pp.329-337, 2008. ,
DOI : 10.1007/978-3-540-69905-7_38
URL : https://hal.archives-ouvertes.fr/hal-00433567
A Path Following Algorithm for the Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, 2008. ,
DOI : 10.1109/TPAMI.2008.245
URL : https://hal.archives-ouvertes.fr/hal-00433567
Phrase-based statistical machine translation as a traveling salesman problem, Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1, ACL-IJCNLP '09, pp.333-341, 2009. ,
DOI : 10.3115/1687878.1687926
Global alignment of protein-protein interaction networks by graph matching methods, Bioinformatics, vol.25, issue.12, p.25, 2009. ,
DOI : 10.1093/bioinformatics/btp196
Iterative point matching for registration of free-form curves and surfaces, Institut National de Recherche en Informatique et en Automatique (INRIA), 1992. ,
DOI : 10.1007/BF01427149