Identifying Occurrences of Maximal Pairs in Multiple Strings

A molecular sequence “model” is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the “Model Matching” and “Model Identification” problems.

Bibliographische Detailangaben

Hauptverfasser:	Iliopoulos, Costas S., Makris, Christos, Sioutas, Spiros, Tsakalidis, Athanasios, Tsichlas, Kostas
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems DNA Matching Exact sciences and technology Search Trees String Algorithms Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!