Syntactical Pattern Recognition
Statistical Pattern Recognition
Adaptive Data Structures
Artificial Neural Networks
Data Retrieval and Storage
Following are some of the major results obtained in the area
of Syntactical Pattern Recognition.
- Have used the theory of optimal and information theoretic syntactic pattern recognition for peptide classification.
(Proc. PRIB 2009, Pat. Rec. 2010).
- Have derived the formal theory for sequence-based estimators
of binomially generated sequences
(Proc. S+SSPR 2006, Pat. Rec. 2007).
This talk was a Plenary/Keynote Talk of the Conference.
- Have devised extremely efficient AI-enhanced trie-based
syntactic pattern recognition schemes
(IEEE T:SMC 2006, Proc. ICAPR 2005).
These results were presented as a plenary talk at the conference in Bath, UK. The results are also patent protected.
- Have devised an efficient look-ahead trie-based syntactic pattern recognition scheme
(PAA 2006, Proc. CORES 2005, ).
- Have devised a fast trie-based syntactic pattern recognition scheme of strings, using the ``Linked List of Prefixes'' data structure (PAA 2007, Proc. S+SSPR 2004).
- Have devised the only known solution for the recognition
of noisy subsequence trees
(IEEE T:PAMI 2001).
This result has been patented.
- Have used parametric string edit distances and vector quantization for designing (training and testing) syntactic pattern classifiers
(IEEE T:SMC 1999).
- Have also generalized the results of 1997 and developed a formal theory for optimal and information theoretic syntactic pattern recognition for traditional and generalized transposition syntactic errors.
- Have proposed a formal theory for optimal and information
theoretic syntactic pattern recognition for traditional syntactic errors.
This result won the Honorable Mention of the Year Award
(Pat. Rec. 1998).
- Have solved the problem of sequence correction when
the sequences and subsequences also contain arbitrary generalized (i.e., noisy) transposition errors
(Pat. Rec. 1997).
- Have proposed the only known solution to the problem of
correcting noisy subsequences. An improved algorithm for achieving
was also published later by myself and Mr. Floyd
(IEEE T:PAMI 1987).
- Have proposed the only known solution to the
constrained string editing problem
(Inf. Sci 1985).