The shortest common superstring problem: average case analysis for both exact and approximate matching

1999 ◽  
Vol 45 (6) ◽  
pp. 1867-1886 ◽  
Author(s):  
En-hui Yang ◽  
Zhen Zhang
Algorithmica ◽  
2006 ◽  
Vol 46 (3-4) ◽  
pp. 469-491 ◽  
Author(s):  
Moritz G. Maass

Author(s):  
Remi Gribonval ◽  
Boris Mailhe ◽  
Holger Rauhut ◽  
Karin Schnass ◽  
Pierre Vandergheynst

Sign in / Sign up

Export Citation Format

Share Document