Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:见过Burrows-Wheeler的一个文章专门讨论这个,复杂度为O(n),发个链接:)In Reply To:见过Burrows-Wheeler的一个文章专门讨论这个,发个链接:) Posted by:gyjisme at 2009-11-23 02:04:22 > http://en.wikipedia.org/wiki/Burrows%E2%80%93Wheeler_transform Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator