String Matching Algorithm String Searching Research Paper

PAGES
6
WORDS
1884
Cite

Much research is being performed on this, and the area has progressed from being simply algorithmic in content to one that has become complex with significant applications. Applications are being extended to fields that include molecular biology and genetic engineering, as well as information retrieval, pattern recognition, biometric authentication (such as speech and speaker recognition, feature recognition, and so forth), program compilation, data compression, program analysis, and system security. Summary and Conclusions

String-searching algorithms are used for matching words, patterns, and concepts from string to text. In order to be as effective as possible, various patterns have been devised. There are those that work according to comparison that simply slide the words -- or pattern -- along the text and attempt to find comparisons. Others use approximate string matching where a pattern is sought. This is faster but allows errors in text to creep in. Other algorithms are formatted on finding the similarity of two strings. Here, for instance, the Bittap algorithm transforms one string into another by converting into numeric value.

With...

...

String-searching algorithms are invaluable to all fields of human knowledge from basic Internet searching to genetic engineering and has significant applications to each and every component of our world of knowledge.

Sources Used in Documents:

References

Book Rags String-Matching Algorithms. http://www.bookrags.com/research/string-matching-algorithms-wcs/

Boyer, R.S., & Moore, J.S. (1977). A fast string searching algorithm, Carom. ACM, 20, 262 -- 272.

Cormen, T.H. et al. (2002). Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Chapter 32: String Matching, pp.906 -- 932.

Karp, R. & Rabin, M.O. (1987). Efficient randomized pattern-matching algorithms. 31. http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf.
Sabin. T. String-matching algorithms. http://caveshadow.com/CS566/Sabin%20M.%20Thomas%20%20String%20Matching%20Algorithms.ppt


Cite this Document:

"String Matching Algorithm String Searching" (2011, April 10) Retrieved April 24, 2024, from
https://www.paperdue.com/essay/string-matching-algorithm-string-searching-13205

"String Matching Algorithm String Searching" 10 April 2011. Web.24 April. 2024. <
https://www.paperdue.com/essay/string-matching-algorithm-string-searching-13205>

"String Matching Algorithm String Searching", 10 April 2011, Accessed.24 April. 2024,
https://www.paperdue.com/essay/string-matching-algorithm-string-searching-13205

Related Documents

Algorithm is a computable set of steps arranged thus in order to achieve a certain end. There are various algorithms used in bioinformatics and not all are necessarily deterministic. Some are in fact known as randomized algorithms that incorporate randomness. Classification of algorithms in Bioinformatics Classification by purpose Each algorithm has a goal. The Quick Sort algorithm for instance sorts data in ascending or descending order, but algorithms in bioinformatics are grouped by

At this stage, an abstract format or generic classification for the data can be developed. Thus we can see how data are organized and where improvements are possible. Structural relationships within data can be revealed by such detailed analysis. The final deliverable will be the search time trial results, and the conclusions drawn with respect to the optimum algorithm designs. A definitive direction for the development of future design work

Aristoxenos, two centuries after Pythagoras released his model, sought to discredit the standing theories held by Pythagorean devotees. In his works, he established that numbers are not relevant to music, and that music is based on perception of what one hears, not any mathematical equation. Descartes as well as Vincenzo Galilei (Galileo's father) both also discredited the music-to-math theories that formed the revolutionary basis for Pythagoras' music work, but not

Mining the Concept of Text
PAGES 10 WORDS 3299

The heuristics that are considered are probabilistic machine learning approaches. Such an approach is the 'Alignment Conditional Random Fields' that is designed for a scoring sequence for undirected graphical models. (Bilenko; Mooney, 2005) There are demands for this type of software and there is a vast area of information analysis where text mining is beginning to get important. One field is in the analysis of literature and research reviews. Literary

Results from the study by Petersen, Ragatz and Monczka show that effective collaborative planning depends on information quality, and the trust level firms share. The authors purport: "Collaborative planning activities between supply chain partners are expected to lead to better performing supply chains" (Petersen, Ragatz & Monczka, Introduction section ¶ 1). In addition, numerous other researchers have also explored the perception relating to supplier alliances, that enhanced collaborative planning

However, cursory studies that have been conducted are either biased because they seem to present a biased review of certain products or are insufficient because of their limitations and shallowness. Those studies that have been considered to be useful are mentioned below. Robert D. Boerner, Joanne Bourquard, Pam Greenberg (2000) comprehensively elaborates the legal aspect of spam. He provides an in-depth review of the present laws in actions and the