Consider a helix in three-dimensional space along which a sequence of equally spaced points is observed, subject to statistical noise. For data coming from a single helix, a two-stage algorithm based on a profile likelihood is developed to compute the maximum likelihood estimate of the helix parameters. Statistical properties of the estimator are studied and comparisons are made to other estimators found in the literature. Next a likelihood ratio test is developed to test if there is a change point in the helix, splitting the data into two sub-helices. The shapes of protein α-helices are used to illustrate the methodology.