Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

CORR
2010
Springer

66views Education» more CORR 2010»

Heapable Sequences and Subsequences

15 years 3 months ago

Heapable Sequences and Subsequences

Download cs-people.bu.edu

John W. Byers, Brent Heeringa, Michael Mitzenmache

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Permutations which are the Union of an Increasing and a Decreasing Subsequence

» Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database

» Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computat...

» Sequences in abelian groups G of odd order without zerosum subsequences of length exp G

» Arcpreserving subsequences of arcannotated sequences

» Online windowed subsequence matching over probabilistic sequences

» AttributeBased Subsequence Matching and Mining

» Highly Scalable and Accurate Seeds for Subsequence Alignment

» Ranked Subsequence Matching in TimeSeries Databases

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas

Comments (0)