Skip to content

A Go implementation of a Generalized Suffix Tree using Ukkonen's algorithm

License

Notifications You must be signed in to change notification settings

larytet-go/suffixtree

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Generalized Suffix Tree

This is a fork of https://github.com/ljfuyuan/suffixtree I need a suffix tree which can work with abstract objects instead of characters and strings. I use the suffix tree for finding patterns in the stream of system events generated by the Linux kernel.

Similar to the https://golang.org/pkg/index/suffixarray/ I allow []byte objects or any other objects implementing Suffixtree.Symbol interface

type Symbol interface {
	IsEqual(other Symbol) bool
	IsLess(other Symbol) bool
}

A Go implementation of a Generalized Suffix Tree using Ukkonen's algorithm

The package just translate from Alessandro Bahgat Shehata's java version to golang and do some optimization
For more details, you should look at abahgat/suffixtree

Usage

package main

import (
	"fmt"

	"github.com/ljfuyuan/suffixtree"
)

func main() {
	words := []string{"banana", "apple", "中文app"}
	tree := suffixtree.NewGeneralizedSuffixTree()
	for k, word := range words {
		tree.Put(word, k)
	}
	indexs := tree.Search("a", -1)

	fmt.Println(indexs)
	//[0 2 1]
	for _, index := range indexs {
		fmt.Println(words[index])
	}
	//banana
	//中文app
	//apple
}

Reading

License

This Generalized Suffix Tree is released under the Apache License 2.0

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

   http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

About

A Go implementation of a Generalized Suffix Tree using Ukkonen's algorithm

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Go 100.0%