|
|
| About site: Algorithms/Sorting and Searching - Suffix Tree |
Return to Computers also Computers |
| About site: http://mila.cs.technion.ac.il/~yona/suffix_tree/ |
Title: Algorithms/Sorting and Searching - Suffix Tree ANSI C implementation of E. Ukkonen's algorithm that makes it convenient to do string matching against a data set in O(N) time. Includes source code, an interface in Perl, and a write-up. |
|
|
|
|
Digital_Mammoth Shared hosting and design. Located in Florida.
| Oztronics ACCEL EDA DBX Utilities for the PCB CAD Designer
| Scriptol_Interpreter Description, examples, FAQ, CD, resources, translations, links. English, Français. Open source, BSD license.
| eBusinessPay_by_eBusinessLogic Online payroll services, including paychecks and paystubs, tax calculations and tax filing, direct deposit and payroll tax forms.
| Fastrak_Systems Provides record keeping systems, third-party administration services, and Internet solutions for Employee Share Purchase Plans, Stock Option Plans, and Employee Benefit Plans.
| Bit_Slicing Growing article, with links to many related topics. [Wikipedia]
|
|
| Alexa statistic for http://mila.cs.technion.ac.il/~yona/suffix_tree/ |
Please visit: http://mila.cs.technion.ac.il/~yona/suffix_tree/
|
| Related sites for http://mila.cs.technion.ac.il/~yona/suffix_tree/ |
| Peachtree_Forums Reseller of Peachtree accounting software. Also offers support and training services. | | SimpleChord Handy reference to chords for musicians. For Mac OS X. | | LinuxWebMasterFree Check out new software every week. We make every effort to insure that all titles are 100% free downloads. Linux people need free ware too right? | | Speechchip_com Online store offering a variety of speech synthesis ICs and boards for using robotics and other applications. | | ESB_New_Technology_Limited Offers wireless data communications systems based on WAP. | | Mainboard_cz Motherboard database sorted by Slot/Socket, chipset, name and manufacturer. Also includes driver downloads, some BIOSes, and identification information. | | The_Search_Engine_Yearbook A regularly updated search engine reference book published by Pandecta Magazine. | | Compiler_Consulting_Resources Individuals and Companies that Provide Compiler Consulting Services. | | Microsoft\'s_C#_Programming_Language_Offers_Developers_Greater_Productivity_and_Potential_of__NET_Platform Company predicts C# will offer C++ developers greater productivity and help them maximize the potential of the new .NET Platform. | | Windows_95_Tips_and_Tricks Topics include installation, multimedia, printing, the taskbar, keyboard shortcuts, Notepad, navigation, and the Internet. | | RFC_0663 Lost Message Detection and Recovery Protocol. R. Kanodia. November 1974. | | Tomcat_User_Mailing_List Searchable web archive of the Tomcat User mailing list. | | Prograph_2_0__Prograph_Grows_Up Article by Dave Kelly, MacTutor Editorial Board. [MacTech, Volume 7 Issue 1] (January, 1991) | | Viscus_Infobiz_Ltd_ Provides hosting on NT and Linux platforms, domain name registration, site design, and e-commerce solutions. | | NetWerkz_Interactive Provides graphics, design, audio, and promotional services. | | Digital_Web_Associates Offers web design and hosting. | | Arachnophilia HTML source editor with templates, tag insertion, internal page viewer, ftp client, and web browser launching. [Java] | | AutoPilot Run many tasks, based on all kinds of triggers. It has drag-and-drop, and cut-and-paste capabilities. | | SCT_-_Sphene_Community_Tools Software includes a wiki and bulletin board application which can be used out of the box to build a community website or used to extend any existing django project. (Python) | | Kimberly\'s_Rainbows_Galore_Sunflowers Collection of rainbow GIFs of clip art, backgrounds and buttons some are animated, also offers sunflower GIFs with related links as well. |
|
This is websites2007.org cache of m/ as retrieved on 2008.09.07 websites2007.org's cache is the snapshot that we took of the page as we crawled the web. The page may have changed since that time.
|
ANSI C implementation of a Suffix Tree
ANSI C implementation of a Suffix Tree
What you will find in this page
You can view and download an ANSI C implementation of a suffix tree.
You can view and download a Perl Module that interfaces the ANSI-C implementation of the suffix tree so you can easily use the functionality under Perl as well.
You can check out links to ports and wrappers to this code to different programming languages.
The Suffix Tree data structure
A suffix tree is a data structure that exposes the internal structure of a string in a deep way, and can be used to solve the exact matching problem in linear time, but its real virtue comes from its use in linear-time solutions to many string problems more complex than exact string matching.
The following definitions are taken from [1], which contains conprehensive overview of the suffix tree data structure:
Definition A suffix tree T for an m-character string S is a rooted directed tree with exactly m leaves numbered 1 to m. Each internal node, other than the root, has at least two children and each edge is labeled with a nonempty substring of S. No two edges out of a node can have edge-labels beginning with the same character. The key feature of the suffix tree is that for any leaf i, the concatenation of the edge-labels on the path from the root to leaf i exactly spells out the suffix of S that starts at position i. That is, it spells out S[i..m].
Authors and maintainers
The source code was initially by Dotan Tsadok who worked (on and off) on it from 24.12.2001 untill 21.8.2002 as his undergraduate project in Haifa university.
The current maintainer is Shlomo Yona.
A Perl interface for this suffix tree data structure is available thanks to Offer Kaye, with whom I produced the first working version.
TODO
Put everyting into a CVS repository.
Slight rewrites to code and documentation so they look nice.
Intensive testing.
Support alphabets from very small (e.g. the 'A','C','G','T' alphabet from biology) to very large (e.g. Chinese alphabet). Current version supports alphabets with no more than 255 characters, and is not memory efficient with very small alphabets (which can be more efficiently treated using bitwise operators).
Enhance the general robustness and scalability of the implementation.
Supply several toy examples for uses of the suffix tree.
Supply several real world examples for uses of the suffix tree.
Supply interfaces to this code under more languages (e.g. Java, Python).
Compilation
Under Linux one would probably do something like this:
make Makefile
Files
Project report summary README.
The original project report Dotan wrote project_report.rtf.
The header file suffix_tree.h.
The implementation file suffix_tree.c.
A simple example of using the code as through the interface as_is_example.c.
A main.c for the Makefile: main.c.
The Makefile Makefile.
or as one tarball: suffix_tree.tar.gz
A Perl Module that interfaces the suffix tree ANSI-C implementation is now available:
SuffixTree-0.03 POD
SuffixTree-0.03.tar.gz
Older versions of the Perl Module:
SuffixTree-0.02.tar.gz
SuffixTree-0.01.tar.gz
Thomas Mailund (<mailund@birc.dk>) has written a wrapper for the suffix tree in Python.
The Python bindings for the suffix tree implementation can
be found here.
Li Zhao (<mr.lizhao@gmail.com>) ported the code to C++ and reports higher performance. His port is available here.
License
Copyright (c) 2002, 2003 Shlomo Yona. All rights reserved.
This library is free software. You can redistribute it and/or modify it under the same terms as Perl itself.
References
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
by Dan Gusfield.
Hardcover - 534 pages 1st edition (January 15, 1997).
Cambridge Univ Pr (Short); ISBN: 0521585198.
Shlomo Yona
var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");document.write(unescape("%3Cscript src="http://mila.cs.technion.ac.il/~yona/suffix_tree//" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));var pageTracker = _gat._getTracker("UA-3326912-2");pageTracker._initData();pageTracker._trackPageview();
|
|
| |
ANSI | C | implementation | of | E. | Ukkonen's | algorithm | that | makes | it | convenient | to | do | string | matching | against | a | data | set | in | O(N) | time. | Includes | source | code, | an | interface | in | Perl, | and | a | write-up. |
|
http://mila.cs.technion.ac.il/~yona/suffix_tree/
Suffix Tree 2008 September
dvd rental
dvd
ANSI C implementation of E. Ukkonen's algorithm that makes it convenient to do string matching against a data set in O(N) time. Includes source code, an interface in Perl, and a write-up.
Rules
|
© 2008 Internet Explorer 5+ or Netscape 6+
|
|
Recommended Sites: 1.
Arts -
Business -
Computers -
Games -
Health -
Home -
Kids and Teens -
News -
Recreation -
Reference -
Regional -
Science -
Shopping -
Society -
Sports -
World
Miss Gallery
- Top Anime Hentai
- DVD rental by mail
- Problem Mortgage - New York Hotels - Agencia de turismo - News - Car Loan
|