Usmereni aciklički graf reči — разлика између измена
Садржај обрисан Садржај додат
Нова страница: U računarstvu, '''usmereni aciklički graf reči''' je strktura podataka koja predstavlja niz sufiksa stringa. Kao što i ime kaže ima formu usmerenog acikličkog grafa. |
мНема описа измене |
||
| Ред 1: | Ред 1: | ||
U računarstvu, '''usmereni aciklički graf reči''' je strktura podataka koja predstavlja niz sufiksa stringa. Kao što i ime kaže ima formu usmerenog acikličkog grafa. |
U računarstvu, '''usmereni aciklički graf reči''' je strktura podataka koja predstavlja niz sufiksa stringa. Kao što i ime kaže ima formu usmerenog acikličkog grafa. |
||
==Literatura== |
|||
*{{citation | doi=10.1109/SPIRE.2001.989743|last1= Inenaga|first1= S.|last2= Hoshino|first2=H.|last3= Shinohara|first3= A. |last4= Takeda|first4= M. |last5= Arikawa|first5= S. |contribution= On-line construction of symmetric compact directed acyclic word graphs|title=Proc. 8th Int. Symp. String Processing and Information Retrieval, 2001. SPIRE 2001|year=2001|pages=96–110|url=http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=989743|isbn= 0-7695-1192-9}}. |
|||
*{{citation | first1=Maxime | last1=Crochemore | first2=Renaud | last2=Vérin | contribution=Direct construction of compact directed acyclic word graphs | series=Lecture Notes in Computer Science | publisher=Springer-Verlag | title=Combinatorial Pattern Matching | year=1997 | pages=116–129 | doi=10.1007/3-540-63220-4_55 }}. |
|||
*{{citation | last1=Epifanio | first1=Chiara | last2=Mignosi | first2=Filippo | last3=Shallit | first3=Jeffrey | last4=Venturini | first4=Ilaria | chapter=Sturmian graphs and a conjecture of Moser | pages=175–187 | editor1-last=Calude | editor1-first=Cristian S. | editor2-last=Calude | editor2-first=Elena | editor3-last=Dineen | editor3-first=Michael J. | title=Developments in language theory. Proceedings, 8th international conference (DLT 2004), Auckland, New Zealand, December 2004 | year=2004 | publisher=Springer-Verlag | series=Lecture Notes in Computer Science | volume=3340 | isbn=3-540-24014-4 | zbl=1117.68454 }} |
|||
*{{citation | first1=H.H. | last1=Do | first2=W.K. | last2=Sung | contribution=Compressed Directed Acyclic Word Graph with Application in Local Alignment | series=Lecture Notes in Computer Science | publisher=Springer-Verlag | title=Computing and Combinatorics | volume=6842 | pages=503–518 | doi=10.1007/978-3-642-22685-4_44 | year=2011 | isbn=978-3-642-22684-7 }} |
|||
[[Категорија:Структуре података]] |
|||
Верзија на датум 29. мај 2013. у 21:39
U računarstvu, usmereni aciklički graf reči je strktura podataka koja predstavlja niz sufiksa stringa. Kao što i ime kaže ima formu usmerenog acikličkog grafa.
Literatura
- Inenaga, S.; Hoshino, H.; Shinohara, A.; Takeda, M.; Arikawa, S. (2001), „On-line construction of symmetric compact directed acyclic word graphs”, Proc. 8th Int. Symp. String Processing and Information Retrieval, 2001. SPIRE 2001, стр. 96—110, ISBN 0-7695-1192-9, doi:10.1109/SPIRE.2001.989743.
- Crochemore, Maxime; Vérin, Renaud (1997), „Direct construction of compact directed acyclic word graphs”, Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer-Verlag, стр. 116—129, doi:10.1007/3-540-63220-4_55.
- Epifanio, Chiara; Mignosi, Filippo; Shallit, Jeffrey; Venturini, Ilaria (2004), „Sturmian graphs and a conjecture of Moser”, Ур.: Calude, Cristian S.; Calude, Elena; Dineen, Michael J., Developments in language theory. Proceedings, 8th international conference (DLT 2004), Auckland, New Zealand, December 2004, Lecture Notes in Computer Science, 3340, Springer-Verlag, стр. 175—187, ISBN 3-540-24014-4, Zbl 1117.68454
- Do, H.H.; Sung, W.K. (2011), „Compressed Directed Acyclic Word Graph with Application in Local Alignment”, Computing and Combinatorics, Lecture Notes in Computer Science, 6842, Springer-Verlag, стр. 503—518, ISBN 978-3-642-22684-7, doi:10.1007/978-3-642-22685-4_44