{"id":64,"date":"2017-05-04T11:19:03","date_gmt":"2017-05-04T15:19:03","guid":{"rendered":"http:\/\/sites.nd.edu\/chaoli-wang\/?page_id=64"},"modified":"2025-08-30T09:58:52","modified_gmt":"2025-08-30T13:58:52","slug":"flowstring","status":"publish","type":"page","link":"https:\/\/sites.nd.edu\/chaoli-wang\/code\/flowstring\/","title":{"rendered":"FlowString"},"content":{"rendered":"

Introduction<\/h2>\n

FlowString is an approach that extracts shape invariant features from streamlines and encodes each streamline into a string of well-selected characters. The set of all characters is called the alphabet<\/i><\/b>. An alphabet can be extracted from a single data set or multiple data sets. We call the alphabet generated from multiple data sets the universal alphabet<\/i><\/b>, which is shown below. Given the encoding of a set of streamlines, the most common patterns are achieved by the most frequently appeared substrings. Each of the most common patterns is called a word<\/i><\/b>, and the set of all words is called the vocabulary<\/i><\/b>. An image of the six words with the highest frequencies in the vocabulary of the solar plume data set is shown below. The streamline segments in a certain pattern can be queried by a string corresponding to that pattern. An image of the streamline segments matched by the string “a’ala'” is shown below.<\/p>\n\n\n\n

\nUniversal alphabet<\/td>\n
\nVocabulary of the solar plume data set<\/td>\n
\nQuery result<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Download<\/h2>\n

FlowString for Windows<\/h3>\n