Analysis of proteomics data: Block k-mean alignment

Similar documents
Functional clustering and alignment methods with applications

Manufacturing Signatures and CMM Sampling Strategies

Principal Component Image Interpretation A Logical and Statistical Approach

Fdakmapp: Optimization of the K-mean Alignment algorithm. APSC Project

Tutorial 7: Automated Peak Picking in Skyline

Using Statistical Techniques to Improve the QC Process of Swell Noise Filtering

N.Priya. Keywords Compass mask, Threshold, Morphological Operators, Statistical Measures, Text extraction

mywbut.com Diffraction

NCSS Statistical Software

Network Traffic Measurements and Analysis

Dyck-Eulerian digraphs

FACE RECOGNITION USING SUPPORT VECTOR MACHINES

Dimension Reduction for Big Data Analysis. Dan Shen. Department of Mathematics & Statistics University of South Florida.

Overlay accuracy fundamentals

Critique: Efficient Iris Recognition by Characterizing Key Local Variations

Simulation of rotation and scaling algorithm for numerically modelled structures

The Anatomical Equivalence Class Formulation and its Application to Shape-based Computational Neuroanatomy

Thermo Xcalibur Getting Started (Quantitative Analysis)

1

Tutorial 2: Analysis of DIA/SWATH data in Skyline

Preprocessing, Management, and Analysis of Mass Spectrometry Proteomics Data

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions

Time Stamp Detection and Recognition in Video Frames

EPSRC Centre for Doctoral Training in Industrially Focused Mathematical Modelling

SIZING THE HEIGHT OF DISCONTINUITIES, THEIR CHARACTERISATION IN PLANAR / VOLUMETRIC BY PHASED ARRAY TECHNIQUE BASED ON DIFFRACTED ECHOES

THE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW

Robust Ring Detection In Phase Correlation Surfaces

8.5 Translating My Composition

Applications of Elastic Functional and Shape Data Analysis

Nature Methods: doi: /nmeth Supplementary Figure 1

Study on the Signboard Region Detection in Natural Image

MRMPROBS tutorial. Hiroshi Tsugawa RIKEN Center for Sustainable Resource Science

Occluded Facial Expression Tracking

The latest trend of hybrid instrumentation

Color Local Texture Features Based Face Recognition

SUPPLEMENTARY INFORMATION

Skin Infection Recognition using Curvelet

Improvement of SURF Feature Image Registration Algorithm Based on Cluster Analysis

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov

On Modeling Variations for Face Authentication

Modeling the Other Race Effect with ICA

Version 1.0 PROTEOMICA DEMYSTIFYING PROTEINS. Indian Institute of Technology Bombay, India Bhushan N Kharbikar

A Fast Personal Palm print Authentication based on 3D-Multi Wavelet Transformation

Signature Recognition by Pixel Variance Analysis Using Multiple Morphological Dilations

Online Signature Verification Technique

1216 P a g e 2.1 TRANSLATION PARAMETERS ESTIMATION. If f (x, y) F(ξ,η) then. f(x,y)exp[j2π(ξx 0 +ηy 0 )/ N] ) F(ξ- ξ 0,η- η 0 ) and

Robust Optical Character Recognition under Geometrical Transformations

Comparative Visualization for Comprehensive Two-Dimensional Gas Chromatography

FIRST RESULTS OF THE ALOS PALSAR VERIFICATION PROCESSOR

SURFACE TEXTURE PARAMETERS FOR FLAT GRINDED SURFACES

CIRCULAR MOIRÉ PATTERNS IN 3D COMPUTER VISION APPLICATIONS

Extracting Road Signs using the Color Information

Computer Vision: Homework 3 Lucas-Kanade Tracking & Background Subtraction

Mass Spec Data Post-Processing Software. ClinProTools. Wayne Xu, Ph.D. Supercomputing Institute Phone: Help:

Investigation of the foot-exposure impact in hyper-na immersion lithography when using thin anti-reflective coating

Subspace Clustering. Weiwei Feng. December 11, 2015

MULTIVARIATE TEXTURE DISCRIMINATION USING A PRINCIPAL GEODESIC CLASSIFIER

SIMULATED LIDAR WAVEFORMS FOR THE ANALYSIS OF LIGHT PROPAGATION THROUGH A TREE CANOPY

Kuske Martyna, Rubio, Rubio Rafael, Nicolas Jacques, Marco Santiago, Romain Anne-Claude

A framework for multi-level semantic trace abstraction

Computational Statistics The basics of maximum likelihood estimation, Bayesian estimation, object recognitions

Fine Classification of Unconstrained Handwritten Persian/Arabic Numerals by Removing Confusion amongst Similar Classes

Wavelength Estimation Method Based on Radon Transform and Image Texture

Mouse Pointer Tracking with Eyes

MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ)

DETECTION OF OUTLIERS IN TWSTFT DATA USED IN TAI

Segmentation of Range Data for the Automatic Construction of Models of Articulated Objects

A Template-Matching-Based Fast Algorithm for PCB Components Detection Haiming Yin

Project Report on. De novo Peptide Sequencing. Course: Math 574 Gaurav Kulkarni Washington State University

Compressed Sensing Algorithm for Real-Time Doppler Ultrasound Image Reconstruction

6. Dicretization methods 6.1 The purpose of discretization

AN IMPROVED HYBRIDIZED K- MEANS CLUSTERING ALGORITHM (IHKMCA) FOR HIGHDIMENSIONAL DATASET & IT S PERFORMANCE ANALYSIS

S-PLUS INSTRUCTIONS FOR CASE STUDIES IN THE STATISTICAL SLEUTH

International Journal of Scientific & Engineering Research, Volume 6, Issue 10, October ISSN

NUMERICAL METHOD TO ESTIMATE TOLERANCES COMBINED EFFECTS ON A MECHANICAL SYSTEM

A Comparison of Error Metrics for Learning Model Parameters in Bayesian Knowledge Tracing

Electromagnetic Field Simulation in Technical Diagnostics

Machine Learning for Pre-emptive Identification of Performance Problems in UNIX Servers Helen Cunningham

Linear Discriminant Analysis for 3D Face Recognition System

GENERAL AUTOMATED FLAW DETECTION SCHEME FOR NDE X-RAY IMAGES

Predictive Analysis: Evaluation and Experimentation. Heejun Kim

GENDER CLASSIFICATION USING SUPPORT VECTOR MACHINES

Linear Algebra Part I - Linear Spaces

3-D MRI Brain Scan Classification Using A Point Series Based Representation

Customizable information fields (or entries) linked to each database level may be replicated and summarized to upstream and downstream levels.

CS 229 Final Project Report Learning to Decode Cognitive States of Rat using Functional Magnetic Resonance Imaging Time Series

Statistical Shape Analysis

Emerge Workflow CE8 SAMPLE IMAGE. Simon Voisey July 2008

SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS

Semi-Supervised PCA-based Face Recognition Using Self-Training

Creating an Automated Blood Vessel. Diameter Tracking Tool

Learning a Manifold as an Atlas Supplementary Material

UX Research in the Product Lifecycle

A New Feature Local Binary Patterns (FLBP) Method

Abstract. 1 Introduction

TraceFinder Analysis Quick Reference Guide

CHAPTER 3 IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN

A System for Automatic Extraction of the User Entered Data from Bankchecks

Weka ( )

An Edge-Swap Heuristic for Finding Dense Spanning Trees

Transcription:

Electronic Journal of Statistics Vol. 8 (2014) 1714 1723 ISSN: 1935-7524 DOI: 10.1214/14-EJS900A Analysis of proteomics data: Block k-mean alignment Mara Bernardi, Laura M. Sangalli, Piercesare Secchi and Simone Vantini MOX Department of Mathematics, Politecnico di Milano Piazza Leonardo da Vinci 32, 20133, Milano, Italy e-mail: marasabina.bernardi@mail.polimi.it; laura.sangalli@polimi.it piercesare.secchi@polimi.it; simone.vantini@polimi.it Abstract: We analyze the proteomics data introducing a block k-mean alignment procedure. This technique is able to jointly align and cluster the data, accounting appropriately for the block structure of these data, that includes measurement repetitions for each patient. An analysis of areaunder-peaks, following the alignment, separates patients who respond and those who do not respond to treatment. Keywords and phrases: Block k-mean alignment, registration, functional clustering, proteomics data. Received August 2013. 1. Block k-mean alignment Motivated by the analysis of the proteomics dataset described in Koch, Hoffman and Marron (2014), we introduce here a variant of the k-mean alignment procedure that accounts appropriately for the block structure of these data. Likewise the k-mean alignment technique described in Sangalli et al. (2010a) and Sangalli, Secchi and Vantini (2014), the proposed block variant is able to jointly align and cluster in k clusters a set of functional data; moreover, it complies with partially exchangeable structures in the data. In the proteomics application, partial exchangeability is due to the presence of measurement repetitions for each subject. Consider a set of functions composed by repetitions of the same measurement on different subjects or experimental units: {f ij (t) i = 1,...,m;j = 1,...,n i }, where m is the number of experimental units, n i is the number of exchangeable measurements for the i-th experimental unit, and f ij (t) is the j-th measurement for the i-th experimental unit at t. The total number of functions is n = n 1 + +n m. The set of exchangeable measurements for the same experimental Main article 10.1214/14-EJS900. Corresponding author. 1714

Block k-mean alignment 1715 unit, {f ij (t) j = 1,...,n i } for i = 1,...,m, is referred to as block. In the proteomics dataset the experimental units are the patients. The block k-mean alignment consists of two concatenated steps: the within block alignment and the between block alignment and clustering. 1) Within block alignment. In this step, each block {f ij (t) j = 1,...,n i }, for i = 1,...,m, is considered independently from the others. The curves within the same block are aligned. To this end, the k-mean alignment algorithm described in Sangalli et al. (2010a) and Sangalli, Secchi and Vantini (2014) is used, with k = 1 (see also Sangalli et al., 2009). In fact, since the curves within the same block are replicated measurements, it does not make sense here to consider multiple clusters. Let f ij be the within block aligned curves. 2) Between block alignment and clustering. In this step, the measurements on the same experimental unit are treated in block. The k-mean alignment algorithm is applied to the m blocks of curves { { } } f1j(t) j = 1,...,n 1,...,{ } fmj (t) j = 1,...,n m, so that the curves in the same block are assigned to the same cluster, each curve in the same block being warped with the same warping function. The total alignment is the composition of the two warping functions found in the two steps, the within block alignment and the between block alignment and clustering. Block k-mean alignment allows to explore possible clustering structures among the experimental units. Thanks to its block structure, it avoids incoherent results where the measurement repetitions of the same experimental units are assigned to different clusters. The analysis here presented have been performed using fdakma R package downloadable from CRAN (see Parodi et al., 2014). 2. Block k-mean alignment of the proteomics data In the Proteomics dataset the fifteen curves are actually five blocks of three curves each: a block represents a patient, while the three curves within each blockareticprofilemeasurementrepetitions.inthiscasem = 5,n i = 3for i = 1,...,5, and the blocks are given by {f 1j = A j j = 1,2,3},{f 2j = B j j = 1,2,3},{f 3j = C j j = 1,2,3}, {f 4j = X j j = 1,2,3},{f 5j = Y j j = 1,2,3}. A simple scheme of the block k-mean alignment in the case of the Proteomics data is represented in Figure 1.

1716 M. Bernardi et al. Fig 1. Scheme of the block k-mean alignment in the case of the Proteomics data. We shall consider two TIC profiles to be perfectly aligned if they are identical up to a multiplicative factor. This choice is due to the characteristics of the data, which have the same baseline and differ only for the peak pattern. Indeed, the signature of a TIC profile is given by the relative heights of the peptide peaks. Therefore, we shall use the following similarity index: ρ(f i,f j ) = fi (s)f j (s)ds (2.1) fi (s) 2 ds fj (s) ds. 2 Indeed this similarity index assigns maximal similarity (similarity equal to 1) to curves that differ only by a positive multiplicative factor: ρ(f i,f j ) = 1 a R + : f i (t) = af j (t). The integrals in (2.1) are computed over the intersection of the domains of the curves f i and f j. The physical phenomenon does not suggest a unique group of warping functions to use, hence the analysis were done with different groups of warping functions in order to choose the group that provides the best results on the data. We choose four groups that are coherent with the similarity index chosen. H affine = {h : h(t) = mt+q with m R +,q R}, H shift = {h : h(t) = t+q with q R},

Block k-mean alignment 1717 Mean similarity indexes Aligned patient A 0.999 0.9992 0.9995 0.9998 1 without alignment shift dilation affine 6.5 7.0 7.5 8.0 8.5 9.0 12 345 6 7 8 9 10 11 12 1314 Patient A Patient B Patient C Patient X Patient Y Aligned patient B Aligned patient C 6.5 7.0 7.5 8.0 8.5 9.0 6.5 7.0 7.5 8.0 8.5 9.0 12 345 6 7 8 9 10 11 12 1314 Aligned patient X Aligned patient Y 6.5 7.0 7.5 8.0 8.5 9.0 6.5 7.0 7.5 8.0 8.5 9.0 12 345 6 7 8 9 10 11 12 1314 12 345 6 7 8 9 10 11 12 1314 0 Fig 2. Results of the within block alignment. The first panel shows the mean similarity indexes of the unaligned curves (black) and those obtained after the alignment with H shift (blue), H dilation (green) and H affine (orange). The other panels show the alignment within each block with H affine warping functions. H dilation = {h : h(t) = mt with m R + }, H identity = {h : h(t) = t}, where the last one corresponds to the case where no alignment is indeed performed. In this analysis the k cluster templates are computed as medoids, i.e., the curves in the sample that maximize the total similarity; see eq. (1.1) in Sangalli, Secchi and Vantini (2014). See Sangalli et al. (2010b) for details. Medoids are in fact more representative of these data that are characterized by numerous sharp peaks. The first panel of Figure 2 shows the results obtained in the first step, the within block alignment. For each of the five patients, the plot shows the means of the similarity indexes between the within block aligned functions and the corresponding within block templates. The black dots represent the means of the similarities between the unaligned data and their within block templates. The

1718 M. Bernardi et al. Mean similarity indexes Similarity indexes 0.9993 0.9995 0.9997 0.9999 without alignment shift dilation affine within block aligned k=1 k=2 k=3 k=4 k=5 0.9992 0.9994 0.9996 0.9998 1.0000 within block aligned k=1 k=2 k=3 k=4 k=5 Fig 3. Results of the between block alignment and clustering. The left panel shows the mean similarity indexes between curves and their corresponding templates, considering different number of clusters k and different classes of warping functions. The right panel displays the boxplots of the similarity indexes obtained using the group of warping functions H shift. blue, green and orange dots indicate the similarities obtained after the within block alignment respectively with only shift, only dilation and affine warping. The figure shows that for all five patients the highest similarity is obtained using the group of affine warping functions. Hence, in the within block alignment step, we choose the group of warping functions H affine. The other panels of Figure 2 show the registration thus obtained by within block alignment. The figure shows a good registration within each block, with the three TIC profiles of each patient well aligned. The bottom of each plot displays the retention s of the reference peptides provided with the data. It should be noticed that the retention s of the reference peptides have not been used for the alignment; they are displayed only to show the good alignment results. The alignment between patients is obtained with the second step: the between block alignment and clustering. The results of this step are shown in Figure 3. The left panel shows the means of the similarity indexes between the functions, aligned and clustered between blocks, and their corresponding templates, for different number of clusters k. The gray dot indicates here the mean similarity of the within block aligned curves and their corresponding within block templates. In black the results obtained with the k-mean alignment with no warping allowed (H identity ), i.e., the functional k-mean clustering. In color the results obtained with different classes of warping functions: only shifts in blue, only dilations in green and affine transformations in orange. For k = 5 the similarities coincide. Indeed, in this case each cluster coincides with a block of (within block) aligned curves, so that there is no need to further align. The left panel of Figure 3 shows that the alignment of the functions increases their similarity. The results obtained with the three groups of warping functions, H shift, H dilation and H affine, are very similar. With only dilation the similarities obtained are slightly lower than those with only shift or affine warping. The similarities obtained with H shift and H affine are almost identical. We therefore choose to use the group H shift. The right panel of Figure 3 shows in blue the

Block k-mean alignment 1719 Aligned data 4 5 6 7 8 9 2 3 45 6 7 8 9 10 11 12 13 14 1 2 3 4 5 6 7 8 9 10 11 12 13 14 1 Fig 4. Total alignment obtained by block k-mean alignment, considering k = 1 cluster (simple alignment without clustering). boxplots of the similarities between the functions, aligned and clustered between blocks with H shift, and their corresponding templates, for different number of clusters k. The gray boxplot refers to the similarities between the within block aligned functions and their corresponding templates. The variability shown by the boxplot of the case k = 5 is the residual variability amongst the within block aligned curves. The total alignment is the composition of the within block alignment with the group of warping functions H affine and the between block alignment and clustering with the group of warping functions H shift. In the following we describe the results obtained by between block alignment and clustering with k = 1 and k = 2 clusters. Figure 4 shows the total alignment obtained with k = 1 cluster (i.e., simple alignment without clustering). A visual inspection of the aligned data and of the retention s of the reference peptides highlights the very good alignment results. Only the first two reference peptides appear not well aligned. Note that the first reference peptide is not well aligned also by the procedures considered for instance in Cheng et al. (2014), Tucker, Wu and Srivastava (2014) and Lu, Koch and Marron (2014). This peptide is not associated to a peak of the TIC profile and we wonder if its reference identification may have been inaccurate. Also the second peptide proves to be difficult to align even when using the more flexible warping functions considered by Tucker, Wu and Srivastava (2014). As suggested by a Referee, the not so good alignment of the first two reference peptides may also be due to a drift effect caused of the measurement instrument (see Koch, Hoffman and Marron (2014)), as the third measurement from each patient appears to have a truncated spectrum, with the first two identified reference peptides offset to the right. See also Figure 2 that better illustrates this aspect in within block aligned TIC profiles. Figure 5 shows the corresponding total warping functions, colored according to two different criteria. In the left panel the colors refer to the patients (blocks): the three warping functions of the TIC profiles for the same patient have the same color. Instead, the right panel displays the same warping functions colored according to the order of

1720 M. Bernardi et al. Warping functions Warping functions registered abscissa patient A patient B patient C patient X patient Y registered abscissa first second third 0 0 original abscissa original abscissa Fig 5. Total warping functions for the case k = 1 colored according to the patient (left panel) and to the order of the TIC profile within the patient (right panel). Cluster 1 (patient A, patient B, patient X) Cluster 2 (patient C, patient Y) 5 6 7 8 9 1 2 345 6 7 8 9 10 11 12 13 14 1 2 345 6 7 8 9 10 11 12 13 14 5 6 7 8 9 Fig 6. Total alignment obtained by block k-mean alignment, considering k = 2 clusters. The two clusters are represented in two different panels. each TIC profile within each patient (block): in red the 5 first TIC profiles for the 5 patients, in light blue the second TIC profiles and in green the thirds. The left panel does not show any clustering of the patients in the phase. This means that phase variability is not related to the patient. Instead, the right panel displays a clear clustering of the warping functions of the first, second and third TIC profiles. The main difference amongst the three groups is the value of the intercept of the warping functions. This phase variability is due to the measuring instrument which introduced a drift in the TIC profiles, as described in Koch, Hoffman and Marron (2014) and already mentioned above. In order to make up for the measurement drift, all the first TIC profiles must be anticipated, while all the third TIC profiles must be delayed. Wenowdescribetheresultsobtainedconsideringk = 2clustersinthebetween block alignment and clustering step, hence exploring possible clustering in the amplitude of the TIC profiles. The case k = 2 is particularly interesting since a visual inspection of the similarities obtained by setting H shift as the group of warping functions, displayed in blue in the left and right panels of Figure 3, suggests the existence of k = 2 clusters. Figure 6 shows the TIC profiles aligned

Block k-mean alignment 1721 Warping functions Warping functions registered abscissa Cluster 1 Cluster 2 registered abscissa first second third 0 0 original abscissa original abscissa Fig 7. Total warping functions for the case k = 2 colored according to the cluster (left panel) and to the order of the TIC profile within the patient (right panel). and clustered in k = 2 clusters, displayed in the two panels. The alignment of the curves within both clusters is very good, with only the first and second peptides being problematic, as commented earlier. The first cluster, left panel, is composed of patients A, B and X, while the second cluster, right panel, is composed of patients C and Y. The left panel of Figure 7 shows the total warping functions, colored according to two clusters. No further clustering is apparent in the phase. Instead, the right panel of the same figure displays the same warping functions colored according to the order of each TIC profile within each patient (block), likewise in the right panel of Figure 5. The same observations made previously, according to clustering in the phase of first, second and third TIC profiles for each patient, still hold. The clustering in amplitude suggested by the procedure (patients A, B, and X in one cluster and patients C and Y in the other) is not related to response to chemotherapy. This clustering is related to some other feature distinguishing the patients and it would be worthy of further investigation; more needs to be know about the patients for this exploration. We note that performing the analysis without considering the partial exchangeable structure of the data, and applying the k-mean algorithm directly to the fifteen TIC profiles, leads to a very similar clustering result, but with the inconsistency that the third TIC profile of patient A is clustered together with the TIC profiles of patients C and Y. With the block k-mean alignment this inconsistency is avoided. It is however possible to discriminate patients who respond and patients who do not respond to chemotherapy using for instance area-under-peaks. Suppose that, after the alignment of the TIC profiles, it is possible to identify the reference peptides, for example by comparison to a given template whose reference peptides retention s are known. We consider the last twelve of the fourteen reference peptides (from the 3 rd to the 14 th ) and exclude instead the first two reference peptides, since they are not well aligned by our procedure. We compute the area under the twelve peaks by fixing a width for each of the twelve

1722 M. Bernardi et al. area under peak 76 78 80 82 84 86 88 90 Responders Nonresponders 3 4 5 6 7 8 9 10 11 12 13 14 peaks Fig 8. Discrimination between responders and non-responders using the area under the peaks. considered peaks and using that same width for all the fifteen TIC profiles. The left panel of Figure 8 shows the values of the area-under-peaks for the fifteen TIC profiles. The red dots correspond to the patients responding to chemotherapy, the blue ones to the patients who are not responding. Some peaks seem to discriminate well the two groups of patients (for example peak 3 and peak 7). We then performed PCA on area-under-peaks to reduce data dimensionality. The right panel of Figure 8 shows the projections of the data along the first three principal components: responders and not-responders are very well separated. We also run the same analysis on the area-under-peaks after subtracting the baseline to the data, obtaining the same results. 3. Discussion As highlighted by the analyses, in this application the warping seems truly affine, and more specifically mainly captured by simple shifts, with phase variability amongst data mostly due to drifts of the measuring instrument. This and the finding on clustering in the phase of first, second and third TIC profiles, are fully consistent with the data description given in Koch, Hoffman and Marron (2014). In fact, also when using classes of warping functions richer than the group of affinities, improvements in the alignment results are noticed when forcing the warping toward linear(lu, Koch and Marron(2014)) or toward simple shifts (Cheng et al. (2014)). Acknowledgements We are grateful to MBI Mathematical Biosciences Institute http://mbi.osu.edu/ for support. L. M. Sangalli acknowledges funding by the research program Dote Ricercatore Politecnico di Milano Regione Lombardia, project: Functional data analysis for life sciences, and by MIUR Ministero dell Istruzione dell Università e della Ricerca, FIRB Futuro in Ricerca starting grant SNAPLE: Statistical and

Block k-mean alignment 1723 Numerical methods for the Analysis of Problems in Life sciences and Engineering http://mox.polimi.it/users/sangalli/firbsnaple.html. References Cheng, W., Dryden, I. L., Hitchcock, D. B. and Le, H. (2014). Analysis of proteomics data: Bayesian alignment of functions. Electronic Journal of Statistics 8 1734 1741, Special Section on Statistics of Time Warpings and Phase Variations. Koch, I., Hoffman, P. and Marron, J. S. (2014). Proteomics profiles from mass spectrometry. Electronic Journal of Statistics 8 1703 1713, Special Section on Statistics of Time Warpings and Phase Variations. Lu, X., Koch, I. and Marron, J. S. (2014). Analysis of proteomics data: Impact of alignment on classification. Electronic Journal of Statistics 8 1742 1747, Special Section on Statistics of Time Warpings and Phase Variations. Parodi, A., Patriarca, M., Sangalli, L. M., Secchi, P., Vantini, S. and Vitelli, V. (2014). fdakma: Clustering and alignment of a given set of curves, R package version 1.1.1. Sangalli, L. M., Secchi, P. and Vantini, S. (2014). Analysis of AneuRisk65 data: k-mean alignment. Electronic Journal of Statistics 8 1891 1904, Special Section on Statistics of Time Warpings and Phase Variations. Sangalli, L. M., Secchi, P., Vantini, S. and Veneziani, A. (2009). A case study in exploratory functional data analysis: Geometrical features of the internal carotid artery. J. Amer. Statist. Assoc. 104 37 48. MR2663032 Sangalli, L. M., Secchi, P., Vantini, S. and Vitelli, V. (2010a). K-mean alignment for curve clustering. Computational Statistics and Data Analysis 54 1219 1233. MR2600827 Sangalli, L. M., Secchi, P., Vantini, S. and Vitelli, V. (2010b). Functional clustering and alignment methods with applications. Communications in Applied and Industrial Mathematics 1 205 224. MR2812260 Tucker, J. D., Wu, W. and Srivastava, A. (2014). Analysis of proteomics data: Phase amplitude separation using extended Fisher-Rao metric. Electronic Journal of Statistics 8 1724 1733, Special Section on Statistics of Time Warpings and Phase Variations.