Sciweavers

161 search results - page 4 / 33
» Counting Distinct Strings
Sort
View

Publication
141views
12 years 5 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
LREC
2008
130views Education» more  LREC 2008»
13 years 8 months ago
ParsCit: an Open-source CRF Reference String Parsing Package
We describe ParsCit, a freely available, open-source implementation of a reference string parsing package. At the core of ParsCit is a trained conditional random field (CRF) model...
Isaac G. Councill, C. Lee Giles, Min-Yen Kan
COMBINATORICS
2002
99views more  COMBINATORICS 2002»
13 years 7 months ago
A Generalization of Simion-Schmidt's Bijection for Restricted Permutations
We consider the two permutation statistics which count the distinct pairs obtained from the final two terms of occurrences of patterns 1
Astrid Reifegerste
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 4 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
COMPGEOM
2010
ACM
14 years 15 days ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir