Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
36
click to vote
DAGSTUHL
2006
favorite
Email
discuss
report
104
views
Software Engineering
»
more
DAGSTUHL 2006
»
Subwords in reverse-complement order
14 years 9 days ago
Download
www.cs.elte.hu
We examine finite words over an alphabet = {a,
Péter L. Erdös, Péter Ligeti, P
Real-time Traffic
DAGSTUHL 2006
|
DAGSTUHL 2007
|
Finite Words
|
Reverse Complement
|
Word W1w2...wt
|
claim paper
Related Content
»
SIMD Architectural Enhancements to Improve the Performance of the 2D Discrete Wavelet Tran...
»
Architectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic...
»
The Subword Reversing Method
»
Chains Subwords and Fillings Strong Equivalence of Three Definitions of the Bruhat Order
»
FirstOrder and Temporal Logics for Nested Words
»
The mColored Composition Poset
»
Bit level types for high level reasoning
»
Binary De Bruijn Partial Words with One Hole
»
SIMD Vectorization of Histogram Functions
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2006
Where
DAGSTUHL
Authors
Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision