Substring Range Reporting (Q3011863)

From MaRDI portal

Revision as of 02:12, 6 May 2025 by Recommendation250413060451 (talk | contribs) (Import recommendations run Q6767936)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Substring Range Reporting

scientific article

Language	Label	Description	Also known as
English	Substring Range Reporting	scientific article

Statements

scholarly article

0 references

Substring Range Reporting (English)

0 references

0 references

0 references

Combinatorial Pattern Matching

0 references

publication date

29 June 2011

0 references

full work available at URL

https://arxiv.org/abs/1108.3683

0 references

MaRDI profile type

0 references

Optimal static range reporting in one dimension

0 references

Property matching and weighted matching

0 references

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

0 references

Filtering Search: A New Approach to Query-Answering

0 references

Range Non-overlapping Indexing

0 references

0 references

Finding Patterns In Given Intervals

0 references

Optimal prefix and suffix queries on texts

0 references

On the sorting-complexity of suffix tree construction

0 references

Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time

0 references

Algorithms on Strings, Trees and Sequences

0 references

Faster index for property matching

0 references

Indexing factors with gaps

0 references

Errata for ``Faster index for property matching''

0 references

Position-Restricted Substring Searching

0 references

Rank and select revisited and extended

0 references

On dynamic range reporting in one dimension

0 references

Time-space trade-offs for predecessor search

0 references

Improved data structures for the orthogonal range successor problem

0 references

Recommended article

Substring range reporting

Similarity Score

0.99999964

Recommender Run

Recommender Run 3

0 references

String Range Matching

Similarity Score

0.83088505

Recommender Run

Recommender Run 3

0 references

Reporting consecutive substring occurrences under bounded gap constraints

Similarity Score

0.8161253

Recommender Run

Recommender Run 3

0 references

Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints

Similarity Score

0.8161253

Recommender Run

Recommender Run 3

0 references

Position-Restricted Substring Searching

Similarity Score

0.7904893

Recommender Run

Recommender Run 3

0 references

Sorted Range Reporting

Similarity Score

0.7757181

Recommender Run

Recommender Run 3

0 references

Similarity Score

0.7709078

Recommender Run

Recommender Run 3

0 references

Substring compression problems

Similarity Score

0.7589177

Recommender Run

Recommender Run 3

0 references

String matching bounds via coding

Similarity Score

0.7549616

Recommender Run

Recommender Run 3

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-21458-5_26

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

conf/cpm/BilleG11

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3011863

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Item:Q3011863&oldid=41578442"