combinatorics | Sciweavers

Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...

Jesper Jansson, Zeshan Peng

claim paper

Read More »

49

click to vote

CPM
2006
Springer

140views Combinatorics» more CPM 2006»

Identifying Co-referential Names Across Large Corpora

14 years 10 months ago

Download www.cs.sunysb.edu

A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...

Levon Lloyd, Andrew Mehler, Steven Skiena

claim paper

Read More »

57

click to vote

CPM
2006
Springer

137views Combinatorics» more CPM 2006»

Large Scale Matching for Position Weight Matrices

14 years 10 months ago

Download www.cs.ucr.edu

Aude Liefooghe, Hélène Touzet, Jean-...

claim paper

Read More »

73

click to vote

CPM
2006
Springer

175views Combinatorics» more CPM 2006»

On-Line Linear-Time Construction of Word Suffix Trees

14 years 10 months ago

Download www.i.kyushu-u.ac.jp

Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...

Shunsuke Inenaga, Masayuki Takeda

claim paper

Read More »

63

click to vote

CPM
2006
Springer

145views Combinatorics» more CPM 2006»

Approximation of RNA Multiple Structural Alignment

14 years 10 months ago

Download www.mimuw.edu.pl

Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...

Marcin Kubica, Romeo Rizzi, Stéphane Vialet...

claim paper

Read More »

58

click to vote

CPM
2006
Springer

114views Combinatorics» more CPM 2006»

New Algorithms for Text Fingerprinting

14 years 10 months ago