String matching as a special case of pattern matching, is a very important field in computer science as much from a theoretical viewpoint as from a practical one. It occurs, for instance, in text processing, information retrieval, and computational biology. The pattern is set up by a finite sequence of characters.
String searching consists in finding one or in general all the occurrences of a word x (pattern) of length m in a text y (text) of length n. Both x and y are built over the same alphabet. Different techniques are being used to design efficient and fast string matching methods and Java, the new buzzword in Computing community, is being used extensively to program the methods for animations over the Internet.
Some informative Web sites
Java String Manipulation: Functions and Methods with EXAMPLE SPIRE 2020: 27th International Symposium on String Processing and Information Retrieval String Processing with Apache Commons Lang 3 SPIRE 2020 : International Symposium on String Processing and Information Retrieval Grammars and Automata for String Processing Handling text — strings in JavaScript Longest property-preserved common factor: A new string-processing framework 