Topic
String (computer science)
About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.
Papers published on a yearly basis
Papers
More filters
•
21 Oct 2005TL;DR: In this article, the structured content and associated metadata from the Web are leveraged to provide specific answer string responses to user questions, which can also be indexed at crawl-time to facilitate searching of the content at search-time.
Abstract: Structured content and associated metadata from the Web are leveraged to provide specific answer string responses to user questions. The structured content can also be indexed at crawl-time to facilitate searching of the content at search-time. Ranking techniques can also be employed to facilitate in providing an optimum answer string and/or a top K list of answer strings for a query. Ranking can be based on trainable algorithms that utilize feature vectors for candidate answer strings. In one instance, at crawl-time, structured content is indexed and automatically associated with metadata relating to the structured content and the source web page. At search-time, candidate indexed structured content is then utilized to extract an appropriate answer string in response to a user query.
104 citations
••
TL;DR: This work presents a methodology for computing the Burrows-Wheeler transform (BWT) of a string collection in a lightweight fashion, and gives two algorithms for recovering the strings in a collection from its BWT.
104 citations
••
28 Jan 2010TL;DR: Action AbstractResourceDemandingActionResource DemandingAction AquireAction ExternalCallAction ParametricResourceDemand demand : String unit : String
Abstract: Action AbstractResourceDemandingActionResourceDemandingAction AquireAction ExternalCallAction ParametricResourceDemand demand : String unit : String
104 citations
••
TL;DR: The experiments show that for the problem of searching many exact patterns in a fixed input string, the lazy top-down construction is often faster and more space efficient than other methods.
Abstract: We present an efficient implementation of a write-only top-down construction for suffix trees. Our implementation is based on a new, space-efficient representation of suffix trees which requires only 12 bytes per input character in the worst case, and 8:5 bytes per input character on average for a collection of files of different type. We show how to efficiently implement the lazy evaluation of suffix trees such that a subtree is evaluated not before it is traversed for the first time. Our experiments show that for the problem of searching many exact patterns in a fixed input string, the lazy top-down construction is often faster and more space efficient than other methods.
104 citations
••
TL;DR: To tackle the problem, Frecpo is developed, a practically efficient algorithm for mining the complete set of frequent closed partial orders from large string databases and several interesting pruning techniques are devised to speed up the search.
Abstract: Mining knowledge about ordering from sequence data is an important problem with many applications, such as bioinformatics, Web mining, network management, and intrusion detection. For example, if many customers follow a partial order in their purchases of a series of products, the partial order can be used to predict other related customers' future purchases and develop marketing campaigns. Moreover, some biological sequences (e.g., microarray data) can be clustered based on the partial orders shared by the sequences. Given a set of items, a total order of a subset of items can be represented as a string. A string database is a multiset of strings. In this paper, we identify a novel problem of mining frequent closed partial orders from strings. Frequent closed partial orders capture the nonredundant and interesting ordering information from string databases. Importantly, mining frequent closed partial orders can discover meaningful knowledge that cannot be disclosed by previous data mining techniques. However, the problem of mining frequent closed partial orders is challenging. To tackle the problem, we develop Frecpo (for frequent closed partial order), a practically efficient algorithm for mining the complete set of frequent closed partial orders from large string databases. Several interesting pruning techniques are devised to speed up the search. We report an extensive performance study on both real data sets and synthetic data sets to illustrate the effectiveness and the efficiency of our approach
104 citations