Title :
An algorithm for finding a common structure shared by a family of strings
Author :
Landraud, Anne M. ; Avril, Jean-Francois ; Chretienne, Philippe
Author_Institution :
Univ. Pierre & Marie Curie, Paris, France
fDate :
8/1/1989 12:00:00 AM
Abstract :
An algorithm is presented for extracting and localizing a common structure in a family of strings with time complexity O(N2 L2 log2 L) where N is the number of strings and L their maximum length. The method could be extended to two-dimensional image analysis. This structure appears as alignments of words which are similar but not necessarily identical and which occur approximately at the same location in all the strings. The method works in two successive stages. First, a fast algorithm is used for drawing up a directory of exactly repeated patterns appearing in a given majority of strings. Second, the algorithm constructs recursively anchoring patterns by a divide-and-conquer strategy and converges on a maximum number of alignments. This algorithm has been applied to find common a priori unknown features in families of biological macromolecules, with quite good results. One of these families included 23 strings of about 100 characters each. Each characteristic structure has been achieved within less than one minute on a MULTIX-DPS8 system
Keywords :
computational complexity; computerised pattern recognition; computerised picture processing; biological macromolecules; computerised pattern recognition; divide-and-conquer strategy; feature extraction; picture processing; strings; time complexity; Character recognition; Dynamic programming; Heuristic algorithms; Image converters; Image processing; Image recognition; Image sequence analysis; Pattern recognition; Reconnaissance; Speech recognition;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on