1Davic W Mount. Bioinformatics: Sequence and Genome Analysis[M]. USA: Cold Spring Harbor Laboratory Press, 2002, 53-54.
2Needleman S, Wunsch C. A general method applicable to the search for similarities in the amino acid sequences of two proteins[J]. Journal of Molecular Biology, 1970, 48(3):443-453.
3Hirschberg D. A linear space algorithm for conputing maximal common subsequences[J]. Comm ACM, 1975,18 (6) :341-343.
4Hirschberg D. Serial Computations of Levenshtein Distances[M]. in: A. Apostolicl, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, 1997, 123-141.
5Ukkonen E. On approximate string matching[J]. Found Comput Theory, 1983, 158(6):487-495.
6David R, Powell, Lloyd Allison, et al. A versatile divide and conquer technique for optimal string alignment[J]. Information Processing Letters, 1999, 70(3):127-139.
7Justin D. Siegel,Joaquín Cea,José Enrique Fernández,Renán E. Rodriguez,David Boyce.Comparisons of Urban Travel Forecasts Prepared with the Sequential Procedure and a Combined Model[J]. Networks and Spatial Economics . 2006 (2)
8Chatterjee A,Seaver W L,Kiattikomol V,Wegmann F J.Models for Forecasting Urban Transit Ridership for Statewide Analysis. Compendium of Papers of the81st Annual Meeting of the Transportation Research Board . 2002
9Kikuchi S,Miljkovic D.Use of Fuzzy Inference for Modeling Prediction of Transit Ridership at Individual Stops. Transportation Research . 2001
10Kikuchi S,Miljkovic D,Stevanovice A.A Model for Predicting Transit Ridership at Individual Stops. . 2001
