logo
logo
x
바코드검색
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

String Processing and Information Retrieval: 31st International Symposium, Spire 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings

String Processing and Information Retrieval: 31st International Symposium, Spire 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings (Paperback, 2025)

Edleno Moura, Zsuzsanna Lipt?, Karina Figueroa (엮은이)
Springer
125,100원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
112,590원 -10% 0원
3,380원
109,210원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

String Processing and Information Retrieval: 31st International Symposium, Spire 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings
eBook 미리보기

책 정보

· 제목 : String Processing and Information Retrieval: 31st International Symposium, Spire 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings (Paperback, 2025) 
· 분류 : 외국도서 > 컴퓨터 > 프로그래밍 > 알고리즘
· ISBN : 9783031721991
· 쪽수 : 364쪽
· 출판일 : 2024-09-19

목차

.- Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets.
.- Bijective BWT based Compression Schemes.
.- Indexing Finite-State Automata Using Forward-Stable Partitions.
.- Burst Edit Distance.
.- Generalization of Repetitiveness Measures for Two-Dimensional Strings.
.- On Computing the Smallest Suffixient Set.
.- Revisiting the Folklore Algorithm for Random Access to Grammar- Compressed Strings.
.- Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts.
.- Bounded-Ratio Gapped String Indexing.
.- Simultaneously Building and Reconciling a Synteny Tree.
.- Quantum Algorithms for Longest Common Substring with a Gap.
.- Online Computation of String Net Frequency.
.- On the Number of Non-equivalent Parameterized Squares in a String.
.- Another virtue of wavelet forests.
.- All-Pairs Suffix-Prefix on Dynamic Set of Strings.
.- Adaptive Dynamic Bitvectors.
.- Compressed Graph Representations for Evaluating Regular Path Queries.
.- Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings.
.- Faster computation of Chinese frequent strings and their net frequencies.
.- Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words.
.- Computing String Covers in Sublinear Time.
.- LZ78 Substring Compression with CDAWGs.
.- 2d Side-Sharing Tandems with Mismatches.
.- Faster and simpler online/sliding rightmost Lempel-Ziv factorizations.
.- Space-efficient SLP Encoding for O(log N)-time Random Access.
.- Simple Linear-time Repetition Factorization.

저자소개

Zsuzsanna Lipt? (엮은이)    정보 더보기
펼치기
Karina Figueroa (엮은이)    정보 더보기
펼치기
도서 정보 제공 : Yes24(www.yes24.com), 알라딘(www.aladin.co.kr)

이 포스팅은 쿠팡파트너스 및 제휴마케팅이 포함된 광고로 이에 따른 일정액의 수수료를 제공받습니다.
최근 본 책